15660 search results - page 64 / 3132 » The Unbalance of Set Systems |
MST
2007
14 years 11 months ago
2007
We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1...
108
click to vote
CCCG
2007
15 years 1 months ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
113
click to vote
ECRTS
2004
IEEE
15 years 3 months ago
2004
IEEE
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
112
click to vote
AUTOMATICA
2007
14 years 12 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
111
click to vote
HIPEAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Iterative optimization has become a popular technique to obtain improvements over the default settings in a compiler for performance-critical applications, such as embedd...