17 search results - page 2 / 4 » Finding the K shortest hyperpaths using reoptimization |
TOC
2008
13 years 5 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
SIGMOD
2008
ACM
13 years 5 months ago
2008
ACM
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
JDA
2008
13 years 5 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
HIPC
2007
Springer
13 years 9 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
SIAMCOMP
2002
13 years 5 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...