789 search results - page 23 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
INFORMATICALT
2000
13 years 7 months ago
2000
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...
AAAI
2006
13 years 9 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...