Sciweavers

2877 search results - page 457 / 576
» The Complexity of Planarity Testing
Sort
View
ICRA
2010
IEEE
134views Robotics» more  ICRA 2010»
15 years 2 months ago
Understanding and executing instructions for everyday manipulation tasks from the World Wide Web
Service robots will have to accomplish more and more complex, open-ended tasks and regularly acquire new skills. In this work, we propose a new approach to generating plans for su...
Moritz Tenorth, Daniel Nyga, Michael Beetz
IJAR
2010
75views more  IJAR 2010»
15 years 2 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
IJRR
2010
162views more  IJRR 2010»
15 years 2 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...
JAIR
2010
153views more  JAIR 2010»
15 years 2 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
KES
2010
Springer
15 years 2 months ago
Extracting Principal Components from Pseudo-random Data by Using Random Matrix Theory
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
Mieko Tanaka-Yamawaki