Sciweavers

96 search results - page 5 / 20
» An Exact Solution to an Approximated Model of RED
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Selecting strategies using empirical game models: an experimental analysis of meta-strategies
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
Christopher Kiekintveld, Michael P. Wellman
SIAMCO
2002
121views more  SIAMCO 2002»
13 years 7 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
TCS
2011
13 years 2 months ago
Sorting and selection on dynamic data
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
ESSMAC
2003
Springer
14 years 17 days ago
Simultaneous Localization and Surveying with Multiple Agents
We apply a constrained Hidden Markov Model architecture to the problem of simultaneous localization and surveying from sensor logs of mobile agents navigating in unknown environmen...
Sam T. Roweis, Ruslan Salakhutdinov
JMLR
2010
118views more  JMLR 2010»
13 years 2 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano