Sciweavers

2089 search results - page 32 / 418
» A New Problem in String Searching
Sort
View
RECOMB
2006
Springer
15 years 10 months ago
Simple and Fast Inverse Alignment
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
John D. Kececioglu, Eagu Kim
GECCO
2009
Springer
15 years 4 months ago
On the performance effects of unbiased module encapsulation
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
R. Paul Wiegand, Gautham Anil, Ivan I. Garibay, Oz...
GECCO
2005
Springer
15 years 3 months ago
New topologies for genetic search space
We propose three distance measures for genetic search space. One is a distance measure in the population space that is useful for understanding the working mechanism of genetic al...
Yong-Hyuk Kim, Byung Ro Moon
ICML
2005
IEEE
15 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
AISC
2004
Springer
15 years 3 months ago
New Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
Tom Kelsey, Steve Linton, Colva M. Roney-Dougal