Sciweavers

2266 search results - page 39 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 3 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
DAC
2005
ACM
15 years 1 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
EVOW
2001
Springer
15 years 4 months ago
A Constructive Evolutionary Approach to School Timetabling
This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constrain...
Geraldo Ribeiro Filho, Luiz Antonio Nogueira Loren...
PPSN
2004
Springer
15 years 5 months ago
Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
Jano I. van Hemert, Johannes A. La Poutré
IJVR
2008
111views more  IJVR 2008»
14 years 11 months ago
Improve a Game Board based on Cultural Algorithms
Evolutionary computation is a generic term used to make reference to the solution of computational problems planned and implemented based on models of an evolutionary process. Most...
Alberto Ochoa, Alejandro Padilla, Saúl Gonz...