Sciweavers

895 search results - page 132 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
LION
2009
Springer
160views Optimization» more  LION 2009»
15 years 5 months ago
Corridor Selection and Fine Tuning for the Corridor Method
In this paper we present a novel hybrid algorithm, in which ideas from the genetic algorithm and the GRASP metaheuristic are cooperatively used and intertwined to dynamically adjus...
Marco Caserta, Stefan Voß
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 4 months ago
Choice and development
The process of development creates a phenotype from one or more genotypes of an individual through interaction with an environment. The opportunity for development to choose a phe...
Arthur M. Farley
EC
2008
146views ECommerce» more  EC 2008»
14 years 10 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 2 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
SEMWEB
2009
Springer
15 years 5 months ago
Graph-Based Ontology Construction from Heterogenous Evidences
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
Christoph Böhm, Philip Groth, Ulf Leser