Sciweavers

133 search results - page 11 / 27
» DIJKSTRA
Sort
View
SOFSEM
2009
Springer
14 years 4 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
VTC
2008
IEEE
14 years 2 months ago
Finding the Best QoS Path in a Gilbert Channel Network
—Many different types of modern wired and wireless communication links can be mathematically described as discretebert channels. In this extended abstract, we present an exact me...
Edwin Soedarmadji
COORDINATION
2007
Springer
14 years 1 months ago
Generalized Committed Choice
We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations ...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
ICN
2007
Springer
14 years 1 months ago
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
There has been an increasing number of network deployments that provide dedicated connections through on-demand and in-advance scheduling in support of highperformance application...
Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li...
DATE
2006
IEEE
108views Hardware» more  DATE 2006»
14 years 1 months ago
Scheduling under resource constraints using dis-equations
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
Hadda Cherroun, Alain Darte, Paul Feautrier