Sciweavers

1064 search results - page 133 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
IWPEC
2010
Springer
15 years 2 months ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 4 months ago
Minimum Dissatisfaction Personnel Scheduling
: In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a se...
Mugurel Ionut Andreica, Romulus Andreica, Angela A...
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 6 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 4 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CIKM
2009
Springer
15 years 11 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer