Sciweavers

520 search results - page 31 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 7 months ago
Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity
—The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matri...
G. Susinder Rajan, B. Sundar Rajan
TON
2010
210views more  TON 2010»
13 years 2 months ago
A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...
Nina Skorin-Kapov, J. Chen, Lena Wosinska
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 7 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
IROS
2007
IEEE
188views Robotics» more  IROS 2007»
14 years 1 months ago
Behavior maps for online planning of obstacle negotiation and climbing on rough terrain
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...
Christian Dornhege, Alexander Kleiner
IAT
2009
IEEE
13 years 11 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser