Sciweavers

39 search results - page 1 / 8
» Construction and Repair: A Hybrid Approach to Search in CSPs
Sort
View
SETN
2004
Springer
13 years 10 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
FLAIRS
2004
13 years 6 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
HM
2007
Springer
155views Optimization» more  HM 2007»
13 years 8 months ago
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
Alexandre R. Duarte, Celso C. Ribeiro, Sebasti&aac...
FLAIRS
2004
13 years 6 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
ICTAI
2010
IEEE
13 years 2 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...