17288 search results - page 159 / 3458 » Hybrid Optimizations: Which Optimization Algorithm to Use |
126
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
94
Voted
COR
2006
15 years 3 months ago
2006
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists o...
129
Voted
NIPS
1993
15 years 4 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
142
Voted
LION
2009
Springer
15 years 10 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
138
Voted
ALGORITHMICA
2005
15 years 3 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...