Sciweavers

436 search results - page 79 / 88
» Decomposing constraint systems: equivalences and computation...
Sort
View
ICRA
2009
IEEE
138views Robotics» more  ICRA 2009»
14 years 3 months ago
Which landmark is useful? Learning selection policies for navigation in unknown environments
Abstract— In general, a mobile robot that operates in unknown environments has to maintain a map and has to determine its own location given the map. This introduces significant...
Hauke Strasdat, Cyrill Stachniss, Wolfram Burgard
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 2 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
PPDP
2004
Springer
14 years 2 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
14 years 15 days ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
IJCV
2002
185views more  IJCV 2002»
13 years 8 months ago
Vision and the Atmosphere
Current vision systems are designed to perform in clear weather. Needless to say, in any outdoor application, there is no escape from "bad" weather. Ultimately, computer ...
Srinivasa G. Narasimhan, Shree K. Nayar