Sciweavers

3049 search results - page 432 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
AI
1999
Springer
15 years 6 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
FOCS
2006
IEEE
16 years 17 days ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
HYBRID
2003
Springer
15 years 11 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
ALDT
2009
Springer
146views Algorithms» more  ALDT 2009»
15 years 11 months ago
Iterated Majority Voting
Abstract. We study a model in which a group of agents make a sequence of collective decisions on whether to remain in the current state of the system or switch to an alternative st...
Stéphane Airiau, Ulle Endriss
NIPS
2008
15 years 8 months ago
Unlabeled data: Now it helps, now it doesn't
Empirical evidence shows that in favorable situations semi-supervised learning (SSL) algorithms can capitalize on the abundance of unlabeled training data to improve the performan...
Aarti Singh, Robert D. Nowak, Xiaojin Zhu