77 search results - page 4 / 16 » Timing optimization by restructuring long combinatorial path... |
178
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
140
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
164
click to vote
IJRR
2008
15 years 5 months ago
2008
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
168
click to vote
GECCO
2009
Springer
15 years 3 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
203
click to vote
IPPS
1995
IEEE
15 years 9 months ago
1995
IEEE
This paper describes improvements to the Mach microkernel’s support for efficient application startup across multiple nodes in a cluster or massively parallel processor. Signifi...