442 search results - page 18 / 89 » Discovering Heuristic Strategy for Solving Scheduling Proble... |
127
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
125
Voted
KR
2004
Springer
15 years 7 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
119
click to vote
IJPP
2008
15 years 1 months ago
2008
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, b...
117
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
141
click to vote
HICSS
2003
IEEE
15 years 7 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...