Sciweavers

582 search results - page 32 / 117
» Analysis of Grain's Initialization Algorithm
Sort
View
FOCS
1999
IEEE
13 years 12 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
IPPS
1998
IEEE
13 years 11 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
AI
2006
Springer
13 years 11 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar
IJAR
2007
55views more  IJAR 2007»
13 years 7 months ago
Theoretical analysis and practical insights on importance sampling in Bayesian networks
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
Changhe Yuan, Marek J. Druzdzel
ECCV
2006
Springer
14 years 9 months ago
Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence
We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to no...
John Oliensis, Richard Hartley