4843 search results - page 196 / 969 » The Shortcut Problem - Complexity and Approximation |
116
click to vote
RECOMB
2001
Springer
16 years 3 months ago
2001
Springer
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
127
click to vote
ESA
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
141
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
105
click to vote
EURODAC
1994
IEEE
15 years 7 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
156
Voted
PEPM
1995
ACM
15 years 7 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...