Sciweavers

92 search results - page 1 / 19
» Making the Breakout Algorithm Complete Using Systematic Sear...
Sort
View
IJCAI
2003
13 years 6 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
CP
2003
Springer
13 years 9 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
EMO
2006
Springer
124views Optimization» more  EMO 2006»
13 years 8 months ago
I-MODE: An Interactive Multi-objective Optimization and Decision-Making Using Evolutionary Methods
With the popularity of efficient multi-objective evolutionary optimization (EMO) techniques and the need for such problem-solving activities in practice, EMO methodologies and EMO ...
Kalyanmoy Deb, Shamik Chaudhuri
IAT
2010
IEEE
13 years 2 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
AIMSA
2008
Springer
13 years 6 months ago
A Hybrid Approach to Distributed Constraint Satisfaction
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...