Sciweavers

88 search results - page 14 / 18
» Solving Non-Boolean Satisfiability Problems with Stochastic ...
Sort
View
EGC
2005
Springer
15 years 3 months ago
A Grid-Oriented Genetic Algorithm
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...
EPIA
1997
Springer
15 years 1 months ago
GenSAT: A Navigational Approach
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
Yury V. Smirnov, Manuela M. Veloso
97
Voted
IAT
2010
IEEE
14 years 7 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
JAIR
2008
145views more  JAIR 2008»
14 years 9 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
107
Voted
CEC
2010
IEEE
14 years 1 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...