Sciweavers

1486 search results - page 75 / 298
» Algorithms for two-box covering
Sort
View
134
Voted
NIPS
2007
15 years 5 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
IROS
2007
IEEE
99views Robotics» more  IROS 2007»
15 years 10 months ago
Robot coverage of terrain with non-uniform traversability
— In this paper, we study how multiple robots can cover known terrain quickly. We extend Multi-Robot Forest Coverage, a state-of-the-art multi-robot coverage algorithm, from terr...
Xiaoming Zheng, Sven Koenig
104
Voted
COLING
2008
15 years 5 months ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown
160
Voted
EC
2008
153views ECommerce» more  EC 2008»
15 years 3 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
137
Voted
BMVC
2010
15 years 1 months ago
Moving Camera Registration for Multiple Camera Setups in Dynamic Scenes
Many practical applications require an accurate knowledge of the extrinsic calibration (i.e., pose) of a moving camera. The existing SLAM and structure-from-motion solutions are n...
Evren Imre, Jean-Yves Guillemaut, Adrian Hilton