Sciweavers

996 search results - page 1 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
CPM
2008
Springer
154views Combinatorics» more  CPM 2008»
13 years 6 months ago
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
Mathias Möhl, Sebastian Will, Rolf Backofen
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
13 years 11 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
IPL
2000
92views more  IPL 2000»
13 years 4 months ago
A general method to speed up fixed-parameter-tractable algorithms
Rolf Niedermeier, Peter Rossmanith
MP
2010
163views more  MP 2010»
12 years 11 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
WWW
2008
ACM
14 years 5 months ago
Speeding up web service composition with volatile external information
This paper introduces a novel method for composing Web services in the presence of external volatile information. Our approach, which we call the informed-presumptive, is compared...
John Harney, Prashant Doshi