2109 search results - page 118 / 422 » Solving Necklace Constraint Problems |
113
click to vote
IJCAI
2001
15 years 6 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
136
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
165
click to vote
CVBIA
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we present a new framework for image segmentation using probabilistic multinets. We apply this framework to integration of regionbased and contour-based segmentation ...
134
click to vote
AIPS
2009
15 years 6 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
144
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...