Sciweavers

135 search results - page 10 / 27
» String Noninclusion Optimization Problems
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
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
14 years 9 months ago
Multi-modal control using adaptive motion description languages
In this paper, we address the problem of adaptively enriching motion description languages for multi-modal control by systematically enlarging the set of available modes. This pro...
Tejas R. Mehta, Magnus Egerstedt
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay
69
Voted
IJCAI
2003
14 years 11 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 3 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom