Sciweavers

805 search results - page 56 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
IJCAI
1993
15 years 5 months ago
Domain Filtering can Degrade Intelligent Backtracking Search
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
Patrick Prosser
HEURISTICS
2002
152views more  HEURISTICS 2002»
15 years 4 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
15 years 10 months ago
Stable Pushing of Assemblies
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
Jay Bernheisel, Kevin M. Lynch
ICFEM
2009
Springer
15 years 9 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
CP
2003
Springer
15 years 9 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie