Sciweavers

2266 search results - page 11 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
DATE
2008
IEEE
142views Hardware» more  DATE 2008»
14 years 11 months ago
Algorithms for Maximum Satisfiability using Unsatisfiable Cores
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
João Marques-Silva, Jordi Planes
COR
2011
14 years 4 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 1 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...
AAAI
2000
14 years 10 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Ordered escape routing based on Boolean satisfiability
Abstract-- Routing for high-speed boards is largely a timeconsuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in boardle...
Lijuan Luo, Martin D. F. Wong