Sciweavers

552 search results - page 49 / 111
» Constrained Shortest Path Computation
Sort
View
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
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...
K. Subramani, Kamesh Madduri
COMGEO
2010
ACM
14 years 10 months ago
Highway hull revisited
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
INFOCOM
1998
IEEE
15 years 2 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
TCBB
2008
113views more  TCBB 2008»
14 years 9 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause
ICPR
2006
IEEE
15 years 11 months ago
Matching 2D Shapes using their Symmetry Sets
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter...