Sciweavers

519 search results - page 30 / 104
» A Meta-CSP Model for Optimal Planning
Sort
View
JAIR
2008
107views more  JAIR 2008»
13 years 9 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
14 years 10 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
ATAL
2006
Springer
14 years 26 days ago
A constraint optimization framework for fractured robot teams
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
Mary Koes, Katia P. Sycara, Illah R. Nourbakhsh
ATMOS
2009
103views Optimization» more  ATMOS 2009»
13 years 10 months ago
Efficient Route Planning in Flight Networks
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while m...
Daniel Delling, Thomas Pajor, Dorothea Wagner, Chr...
TRANSCI
2010
169views more  TRANSCI 2010»
13 years 3 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...