Sciweavers

1983 search results - page 195 / 397
» Competitive graph searches
Sort
View
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
14 years 2 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
SPIRE
2007
Springer
14 years 2 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
14 years 29 days ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICLP
1999
Springer
14 years 12 days ago
Comparing Trailing and Copying for Constraint Programming
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
Christian Schulte
AAAI
2010
13 years 9 months ago
Learning Simulation Control in General Game-Playing Agents
The aim of General Game Playing (GGP) is to create intelligent agents that can automatically learn how to play many different games at an expert level without any human interventi...
Hilmar Finnsson, Yngvi Björnsson