Sciweavers

2266 search results - page 43 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
CEC
2009
IEEE
15 years 3 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
IJCAI
2001
15 years 1 months ago
On Market-Inspired Approaches to Propositional Satisfiability
We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variatio...
William E. Walsh, Makoto Yokoo, Katsutoshi Hirayam...
ICALP
2010
Springer
15 years 4 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
IGPL
2006
87views more  IGPL 2006»
14 years 11 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
ECAL
2007
Springer
15 years 6 months ago
PLAZZMID: An Evolutionary Agent-Based Architecture Inspired by Bacteria and Bees
Abstract. Classical evolutionary algorithms have been extremely successful at solving certain problems. But they implement a very simple model of evolutionary biology that misses o...
Susan Stepney, Tim Clarke, Peter Young