Sciweavers

717 search results - page 69 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
90 views 101 votes 15 years 1 months ago  AIR 1999»
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
326 views 131 votes 15 years 7 months ago  GECCO 2007»
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
107 views 184 votes 16 years 2 months ago  CP 2009»
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
89 views 121 votes 15 years 2 months ago  AAAI 1994»
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
143 views 101 votes 15 years 2 months ago  AAAI 2000»
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
112 views 110 votes 15 years 8 months ago  CPAIOR 2009»
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...
118 views 106 votes 15 years 7 months ago  IAT 2006»
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
225 views 127 votes 15 years 7 months ago  ICRA 2006»
— 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...
116 views 106 votes 15 years 2 months ago  AAAI 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...
124 views 125 votes 15 years 1 months ago  CORR 2010»
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...