154 search results - page 26 / 31 » Anytime search in dynamic graphs |
AICCSA
2006
IEEE
14 years 1 months ago
2006
IEEE
The specification, analysis, and administration of business processes have charged great importance in this last time. This has been caused by a competitive industry necessity, dy...
COMPGEOM
2004
ACM
14 years 27 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
ICRA
2003
IEEE
14 years 22 days ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
ICRA
2002
IEEE
14 years 11 days ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
IJCAI
2007
13 years 9 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...