14548 search results - page 2516 / 2910 » The Optimal Path-Matching Problem |
171
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
177
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
196
Voted
RECOMB
1997
Springer
15 years 11 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
166
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
197
click to vote
COMSWARE
2007
IEEE
15 years 10 months ago
2007
IEEE
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within a...