Sciweavers

13987 search results - page 326 / 2798
» The Two Guards Problem
Sort
View
EMNLP
2007
15 years 8 months ago
A Sequence Alignment Model Based on the Averaged Perceptron
We describe a discriminatively trained sequence alignment model based on the averaged perceptron. In common with other approaches to sequence modeling using perceptrons, and in co...
Dayne Freitag, Shahram Khadivi
ICGA
1993
96views Optimization» more  ICGA 1993»
15 years 8 months ago
Dynamic Control of Genetic Algorithms in a Noisy Environment
In this paper, we present e cient algorithms for adjusting con guration parameters of genetic algorithms that operate in a noisy environment. Assuming that the population size is ...
Akiko N. Aizawa, Benjamin W. Wah
248
Voted
CDC
2010
IEEE
145views Control Systems» more  CDC 2010»
14 years 10 months ago
Cooperative mission planning for a class of carrier-vehicle systems
Abstract— In this work we focus on mission planning problems in scenarios in which a carrier vehicle, typically slow but with virtually infinite range, and a carried vehicle, wh...
Emanuele Garone, Roberto Naldi, Alessandro Casavol...
ISCAS
2006
IEEE
70views Hardware» more  ISCAS 2006»
16 years 23 days ago
A systolic array technique for determining common approximate substrings
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
Kenneth B. Kent, Jacqueline E. Rice
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
16 years 22 days ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang