Sciweavers

13987 search results - page 329 / 2798
» The Two Guards Problem
Sort
View
EOR
2010
82views more  EOR 2010»
15 years 6 months ago
Satisfactory graph partition, variants, and generalizations
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
ENTCS
2008
108views more  ENTCS 2008»
15 years 6 months ago
E-matching for Fun and Profit
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry
MOC
2000
84views more  MOC 2000»
15 years 6 months ago
Solving Thue equations without the full unit group
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
Guillaume Hanrot
CP
2010
Springer
15 years 5 months ago
Propagating the Bin Packing Constraint Using Linear Programming
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Hadrien Cambazard, Barry O'Sullivan
SIAMCO
2010
108views more  SIAMCO 2010»
15 years 5 months ago
Reach Control on Simplices by Continuous State Feedback
This paper studies a theoretical problem of whether continuous state feedback and affine feedback are equivalent from the point of view of making an affine system defined on a sim...
Mireille E. Broucke