2109 search results - page 105 / 422 » Solving Necklace Constraint Problems |
158
click to vote
HEURISTICS
2008
15 years 3 months ago
2008
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...
145
click to vote
AAAI
1994
15 years 6 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
169
click to vote
ICIP
1999
IEEE
16 years 6 months ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
150
Voted
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
150
click to vote
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
— Rigid body dynamics with contact constraints can be solved locally using linear complementarity techniques. However, these techniques do not impose the original constraints and...