Sciweavers

32 search results - page 5 / 7
» Computing Parameter Domains as an Aid to Planning
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Closing the learning-planning loop with predictive state representations
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
Byron Boots, Sajid M. Siddiqi, Geoffrey J. Gordon
DAC
2010
ACM
13 years 7 months ago
QuickYield: an efficient global-search based parametric yield estimation with performance constraints
With technology scaling down to 90nm and below, many yield-driven design and optimization methodologies have been proposed to cope with the prominent process variation and to incr...
Fang Gong, Hao Yu, Yiyu Shi, Daesoo Kim, Junyan Re...
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 1 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
HRI
2007
ACM
13 years 11 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy
ICRA
2007
IEEE
148views Robotics» more  ICRA 2007»
14 years 1 months ago
Seamless Execution of Action Sequences
— One of the most notable and recognizable features of robot motion is the abrupt transitions between actions in action sequences. In contrast, humans and animals perform sequenc...
Freek Stulp, Wolfram Koska, Alexis Maldonado, Mich...