Sciweavers

4524 search results - page 259 / 905
» The Complexity of Global Constraints
Sort
View
AI
2003
Springer
15 years 12 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
CP
2010
Springer
15 years 5 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...
ICRA
2005
IEEE
130views Robotics» more  ICRA 2005»
16 years 10 days ago
Effective Constrained Dynamic Simulation Using Implicit Constraint Enforcement
- Stable and effective enforcement of hard constraints is one of the crucial components in controlling physics-based dynamic simulation systems. The conventional explicit Baumgarte...
Min Hong, Min-Hyung Choi, Sunhwa Jung, Samuel W. J...
VMCAI
2004
Springer
16 years 2 days ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
INFORMS
1998
150views more  INFORMS 1998»
15 years 6 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper