Sciweavers

2089 search results - page 118 / 418
» A New Problem in String Searching
Sort
View
CG
1998
Springer
15 years 2 months ago
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
Andreas Junghanns, Jonathan Schaeffer
GECCO
2000
Springer
131views Optimization» more  GECCO 2000»
15 years 1 months ago
A Genetic Algorithm with Tabu Search for Multimodal and Multiobjective Function Optimization
The integration of genetic algorithms (GAs) and tabu search is one of traditional problems in function optimization in the GA literature. However, most proposed methods have utili...
Setsuya Kurahashi, Takao Terano
CONSTRAINTS
2011
14 years 5 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 3 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
14 years 12 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri