Sciweavers

971 search results - page 25 / 195
» Planning with Reduced Operator Sets
Sort
View
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
15 years 3 months ago
Planning with Continuous Actions in Partially Observable Environments
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
Matthijs T. J. Spaan, Nikos A. Vlassis
ICTAI
2000
IEEE
15 years 1 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
GLOBECOM
2010
IEEE
14 years 8 months ago
Energy-Efficient WDM Network Planning with Dedicated Protection Resources in Sleep Mode
Abstract--Energy-efficient optical networks are gaining momentum as environmental-friendly solutions with reduced operational costs. Energy-efficiency can be achieved by using devi...
Ajmal Muhammad, Paolo Monti, Isabella Cerutti, Len...
URBAN
2008
128views more  URBAN 2008»
14 years 9 months ago
Discerning landslide susceptibility using rough sets
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
Pece V. Gorsevski, Piotr Jankowski
TCS
2008
14 years 9 months ago
Reconstruction of convex lattice sets from tomographic projections in quartic time
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
Sara Brunetti, Alain Daurat