Sciweavers

4513 search results - page 609 / 903
» Logic programming with satisfiability
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 2 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
CPAIOR
2010
Springer
15 years 2 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
MP
2010
92views more  MP 2010»
14 years 11 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
ICCV
2011
IEEE
14 years 4 months ago
3D Reconstruction of a Smooth Articulated Trajectory from a Monocular Image Sequence
An articulated trajectory is defined as a trajectory that remains at a fixed distance with respect to a parent trajectory. In this paper, we present a method to reconstruct an a...
Hyun Soo Park, Yaser Sheikh
SIGSOFT
2007
ACM
16 years 5 months ago
Efficient checkpointing of java software using context-sensitive capture and replay
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
Guoqing Xu, Atanas Rountev, Yan Tang, Feng Qin