1485 search results - page 101 / 297 » Whole Program Paths |
CC
2004
Springer
14 years 2 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
ICFEM
2000
Springer
14 years 27 days ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
IVEVA
2004
13 years 10 months ago
2004
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...
ISMB
1997
13 years 10 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
JDA
2010
13 years 4 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...