Sciweavers

366 search results - page 64 / 74
» Dynamic Programming for Graphs on Surfaces
Sort
View
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
14 years 1 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
ICRA
2003
IEEE
125views Robotics» more  ICRA 2003»
14 years 23 days ago
Online footstep planning for humanoid robots
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...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 12 days ago
Resolution Complete Rapidly-Exploring Random Trees
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...
Peng Cheng, Steven M. LaValle
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
13 years 11 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu