Sciweavers

43 search results - page 4 / 9
» Approximate dynamic programming for rail operations
Sort
View
ICRA
2010
IEEE
123views Robotics» more  ICRA 2010»
13 years 6 months ago
Robotic motion planning in dynamic, cluttered, uncertain environments
— This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires r...
Noel E. Du Toit, Joel W. Burdick
27
Voted
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
FATES
2006
Springer
13 years 11 months ago
Dynamic Architecture Extraction
Abstract. Object models capture key properties of object-oriented architectures, and they can highlight relationships between types, occurrences of sharing, and object encapsulatio...
Cormac Flanagan, Stephen N. Freund
ATAL
2010
Springer
13 years 8 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro