2313 search results - page 64 / 463 » On Heuristic Time Hierarchies |
141
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
137
click to vote
AROBOTS
2004
15 years 6 months ago
2004
In this paper, we present discrete-time, nonspatial, macroscopic models able to capture the dynamics of collective aggregation experiments using groups of embodied agents endowed ...
157
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
154
click to vote
AAAI
2008
15 years 8 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
232
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...