Sciweavers

21 search results - page 3 / 5
» Bandit Based Monte-Carlo Planning
Sort
View
AIPS
2011
12 years 11 months ago
Sample-Based Planning for Continuous Action Markov Decision Processes
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
Christopher R. Mansley, Ari Weinstein, Michael L. ...
ICC
2007
IEEE
160views Communications» more  ICC 2007»
14 years 1 months ago
Efficient Coverage Planning for Grid-Based Wireless Sensor Networks
- In this paper we study efficient triangular grid-based sensor deployment planning for coverage when sensor placements are perturbed by random errors around their corresponding gr...
Glen Takahara, Kenan Xu, Hossam S. Hassanein
VTC
2007
IEEE
111views Communications» more  VTC 2007»
14 years 1 months ago
Analysis of a Spline Based, Obstacle Avoiding Path Planning Algorithm
—The Overbot is one of the original DARPA Grand Challenge vehicles now being used as a platform for autonomous vehicle research. The vehicle, equipped with a complete actuator an...
John Connors, Gabriel Elkaim
ICCAD
1998
IEEE
95views Hardware» more  ICCAD 1998»
13 years 11 months ago
Efficient analog circuit synthesis with simultaneous yield and robustness optimization
This paper presents an efficient statistical design methodology that allows simultaneous sizing for performance and optimization for yield and robustness of analog circuits. The s...
Geert Debyser, Georges G. E. Gielen
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
13 years 11 months ago
MashRank: Towards uncertainty-aware and rank-aware mashups
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
Mohamed A. Soliman, Mina Saleeb, Ihab F. Ilyas