908 search results - page 156 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
146
Voted
GECCO
2000
Springer
15 years 5 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
132
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
107
click to vote
JAIR
2008
15 years 1 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
147
click to vote
ICRA
2000
IEEE
15 years 5 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...