Sciweavers

4843 search results - page 631 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 10 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
IAT
2005
IEEE
15 years 10 months ago
Decomposing Large-Scale POMDP Via Belief State Analysis
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
Xin Li, William K. Cheung, Jiming Liu
ICPP
2005
IEEE
15 years 10 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 10 months ago
Game Theoretic Control for Robot Teams
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
IPPS
2005
IEEE
15 years 10 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner