1639 search results - page 69 / 328 » Anytime Heuristic Search |
100
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
71
Voted
HICSS
1997
IEEE
15 years 4 months ago
1997
IEEE
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...
104
Voted
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
109
Voted
EPIA
2007
Springer
15 years 6 months ago
2007
Springer
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second tak...
78
Voted
EUROSIM
1994
15 years 1 months ago
1994
This paper introduces Pact, a new model for parallel heuristic programming on MIMD machines. Designed and implemented as an integrated tool environment, Pact allows the user to dev...