Sciweavers

361 search results - page 35 / 73
» Approximate counting by dynamic programming
Sort
View
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
13 years 2 months ago
Learning in mean-field oscillator games
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday...
NIPS
2001
13 years 9 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
ESOP
1990
Springer
13 years 11 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy
JAIR
2010
115views more  JAIR 2010»
13 years 6 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
ISCAPDCS
2004
13 years 9 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson