Sciweavers

879 search results - page 164 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
FOCS
2000
IEEE
15 years 6 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
BIBM
2007
IEEE
132views Bioinformatics» more  BIBM 2007»
15 years 8 months ago
A Divide-and-Conquer Implementation of Three Sequence Alignment and Ancestor Inference
In this paper, we present an algorithm to simultaneously align three biological sequences with affine gap model and infer their common ancestral sequence. Our algorithm can be fu...
Feng Yue, Jijun Tang
111
Voted
ICRA
2008
IEEE
128views Robotics» more  ICRA 2008»
15 years 8 months ago
A point-based POMDP planner for target tracking
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
David Hsu, Wee Sun Lee, Nan Rong
ICPR
2002
IEEE
15 years 6 months ago
Feature Extraction Methods Applied to the Clustering of Electrocardiographic Signals. A Comparative Study
In this paper, a method to automatically extract the main information from a long-term electrocardiographic signal is presented. This method is based on techniques of pattern reco...
David Cuesta-Frau, Juan Carlos Pérez-Cortes...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
14 years 11 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...