Sciweavers

1263 search results - page 57 / 253
» A* with Bounded Costs
Sort
View
JACM
2011
98views more  JACM 2011»
14 years 4 months ago
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
Haim Avron, Sivan Toledo
SIAMCO
2010
132views more  SIAMCO 2010»
14 years 4 months ago
Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...
Vincent D. Blondel, Julien M. Hendrickx, John N. T...
AAAI
1997
14 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
15 years 3 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
ICML
2004
IEEE
15 years 10 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm