908 search results - page 47 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
120
Voted
AAAI
2007
15 years 6 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
147
Voted
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
129
click to vote
SARA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
113
Voted
HAIS
2009
Springer
15 years 8 months ago
2009
Springer
The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In...
141
Voted
FUIN
2010
15 years 1 months ago
2010
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...