Results 1 to 10 of about 101,154 (305)
The Algebraic Intersection Type Unification Problem [PDF]
Logical Methods in Computer Science, 2017 The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems.
Andrej Dudenhefner +2 more
doaj +3 more sources
The matroid intersection cover problem [PDF]
Operations Research Letters, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kirk Prühs
exaly +3 more sources
The unimodular intersection problem [PDF]
Operations Research Letters, 2015 We show that finding minimally intersecting $n$ paths from $s$ to $t$ in a directed graph or $n$ perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
Volker Kaibel +2 more
openaire +3 more sources
The 3-way flower intersection problem for Steiner triple systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The flower at a point x in a Steiner triple system (X; B) is the set of all triples containing x. Denote by J3F(r) the set of all integers k such that there exists a collection of three STS(2r+1) mutually intersecting in the same set of k + r triples, r ...
H. Amjadi, N. Soltankhah
doaj +1 more source
Processing Traffic Jam in Al-Sadrain Intersection in the Holy City of Najaf [PDF]
E3S Web of Conferences, 2023 Modern metropolitan cities worldwide suffer from heavy congestion due to high daily commutes for various purposes. Intersections are the most congested component of the network and represent the sites of accidents.
Bedewy Baydaa A. +3 more
doaj +1 more source
Non-Roundabout design of cancel the intersection signal light on horizontal plane [PDF]
E3S Web of Conferences, 2019 Traffic congestion is a world problem and an important factor restricting urban development. In order to solve the problem of urban traffic congestion, this paper takes the traffic flow theory and the intersection channel design theory as the research ...
Yuilin He +2 more
doaj +1 more source
Geometric intersection problems [PDF]
17th Annual Symposium on Foundations of Computer Science (sfcs 1976), 1976 We develop optimal algorithms for forming the intersection of geometric objects in the plane and apply them to such diverse problems as linear programming, hidden-line elimination, and wire layout. Given N line segments in the plane, finding all intersecting pairs requires O(N2) time.
Michael Ian Shamos, Dan Hoey
openaire +1 more source
Mathematics, 2022 In industrial applications, many systems present serious productivity problems due to limited resources. Generally, the dynamics of resource allocation are inherently discrete-event driven, such as the buffer allocation in production line systems.
Yunfeng Hou +5 more
doaj +1 more source
On the Zarankiewicz Problem for Intersection Hypergraphs [PDF]
Journal of Combinatorial Theory, Series A, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mustafa, Nabil, Pach, János
openaire +6 more sources
Inhabitation for Non-idempotent Intersection Types [PDF]
Logical Methods in Computer Science, 2018 The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the ...
Antonio Bucciarelli +2 more
doaj +1 more source