Sciweavers

103 search results - page 5 / 21
» Minimal Separating Sequences for All Pairs of States
Sort
View
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
13 years 10 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
14 years 2 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
BMCBI
2011
13 years 4 months ago
Analysis on the reconstruction accuracy of the Fitch method for inferring ancestral states
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...
Jialiang Yang, Jun Li, Liuhuan Dong, Stefan Gr&uum...
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
14 years 7 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 2 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag