Sciweavers

2168 search results - page 303 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ATAL
2003
Springer
15 years 8 months ago
Transition-independent decentralized markov decision processes
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
128
Voted
RAS
2002
105views more  RAS 2002»
15 years 3 months ago
Visually guided manipulation tasks
In this paper, we present a framework for a robotic system with the ability to perform real-world manipulation tasks. The complexity of such tasks determines the precision and fre...
Danica Kragic, Lars Petersson, Henrik I. Christens...
119
Voted
IJCM
2010
80views more  IJCM 2010»
15 years 1 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
JAIR
2010
115views more  JAIR 2010»
15 years 1 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
CVPR
2008
IEEE
16 years 5 months ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert