86 search results - page 9 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
106
Voted
EOR
2008
14 years 11 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
91
Voted
AI
2007
Springer
14 years 11 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
80
Voted
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...