3677 search results - page 64 / 736 » Generalized Adaptive A* |
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
158
click to vote
CLUSTER
2009
IEEE
16 years 29 days ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
225
click to vote
ISPD
2005
ACM
15 years 11 months ago
2005
ACM
We streamline and extend APlace, the general analytic placement engine based on ideas of Naylor et al. [7] and described in [3, 4, 5]. Previous work explored the adaptability of A...
140
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
170
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...