717 search results - page 70 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
IAT
2006
IEEE
15 years 3 months ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
AAAI
2000
14 years 11 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive...