Sciweavers

592 search results - page 12 / 119
» Learning Generalized Plans Using Abstract Counting
Sort
View
NIPS
2003
13 years 9 months ago
Approximate Planning in POMDPs with Macro-Actions
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
Georgios Theocharous, Leslie Pack Kaelbling
SIGCOMM
2009
ACM
14 years 2 months ago
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...
Ramana Rao Kompella, Kirill Levchenko, Alex C. Sno...
SG
2004
Springer
14 years 1 months ago
A Framework Supporting General Object Interactions for Dynamic Virtual Worlds
Abstract. This work introduces a new interaction framework for dynamic virtual environments. The proposed system is designed to deal with all possible interactions in a virtual wor...
Pieter Jorissen, Wim Lamotte
IUI
2003
ACM
14 years 1 months ago
Supporting plan authoring and analysis
Interactive tools to help users author plans or processes are essential in a variety of domains. KANAL helps users author sound plans by simulating them, checking for a variety of...
Jihie Kim, Jim Blythe
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
14 years 1 months ago
Trap Avoidance in Strategic Computer Game Playing with Case Injected Genetic Algorithms
Abstract. We use case injected genetic algorithms to learn to competently play computer strategy games. Such games are characterized by player decision in anticipation of opponent ...
Chris Miles, Sushil J. Louis, Rich Drewes