2254 search results - page 5 / 451 » Computing the minimal covering set |
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
ISMVL
2009
IEEE
14 years 4 months ago
2009
IEEE
A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f. Since this holds if and only if f belongs to...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
CIE
2006
Springer
14 years 1 months ago
2006
Springer
We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...