Sciweavers

2089 search results - page 244 / 418
» A New Problem in String Searching
Sort
View
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
15 years 6 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 3 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
15 years 3 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
TEC
2002
152views more  TEC 2002»
15 years 2 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 9 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim