6105 search results - page 194 / 1221 » A Parallel Algorithm for Bound-Smoothing |
180
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
This paper is concerned with a fixed-size population of autonomous agents facing unknown, possibly changing, environments. The motivation is to design an embodied evolutionary algo...
232
click to vote
GCA
2009
15 years 4 months ago
2009
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
131
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
158
click to vote
TPDS
2002
15 years 6 months ago
2002
This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposit...
161
click to vote
ICPP
2005
IEEE
15 years 12 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...