Sciweavers

882 search results - page 131 / 177
» Local Search for Very Large SAT Problems
Sort
View
ICARIS
2010
Springer
15 years 1 months ago
An Information-Theoretic Approach for Clonal Selection Algorithms
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone, ...
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 9 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
SIGIR
2009
ACM
15 years 10 months ago
CompositeMap: a novel framework for music similarity measure
With the continuing advances in data storage and communication technology, there has been an explosive growth of music information from different application domains. As an effe...
Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wa...
BMCBI
2006
145views more  BMCBI 2006»
15 years 3 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
ICIAP
2007
ACM
16 years 4 months ago
Learning Repetitive Patterns for Classifying Non-Rigidly Deforming Texture Surfaces
In this paper, we address the relatively unexplored problem of classifying texture surfaces undergoing significant levels of non-rigid deformation. State-of-the-art texture classi...
Roman Filipovych, Eraldo Ribeiro