Sciweavers

614 search results - page 56 / 123
» Probabilistic Arc Consistency
Sort
View
116
Voted
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 3 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
DISOPT
2010
138views more  DISOPT 2010»
15 years 3 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
117
Voted
AI
2006
Springer
15 years 3 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
132
Voted
IJRR
2006
89views more  IJRR 2006»
15 years 3 months ago
Time-optimal Trajectories for an Omni-directional Vehicle
A common mobile robot design consists of three `omniwheels' arranged at the vertices of an equilateral triangle, with wheel axles aligned with the rays from the center of the...
Devin J. Balkcom, Paritosh A. Kavathekar, Matthew ...
144
Voted
JETAI
2010
115views more  JETAI 2010»
15 years 2 months ago
From soft constraints to bipolar preferences: modelling framework and solving issues
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...