Sciweavers

1644 search results - page 151 / 329
» Finding Dominators in Practice
Sort
View
TON
2008
125views more  TON 2008»
13 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
CORR
2000
Springer
67views Education» more  CORR 2000»
13 years 8 months ago
The dynamics of iterated transportation simulations
Abstract: Iterating between a router and a traffic micro-simulation is an increasibly accepted method for doing traffic assignment. This paper, after pointing out that the analytic...
Kai Nagel, Marcus Rickert, Patrice M. Simon, Marti...
OIR
2008
87views more  OIR 2008»
13 years 8 months ago
E-science and information services: a missing link in the context of digital libraries
: Purpose: This paper analysis if and how far Library and Information Services (LIS) are supporting E-Science and Grid-Computing projects funded by authorities in the EU and German...
Achim Osswald
SIAMJO
2008
136views more  SIAMJO 2008»
13 years 8 months ago
Relaxed Alternating Projection Methods
Let A and B be nonempty, convex and closed subsets of a Hilbert space H. In the practical considerations we need to find an element of the intersection A B or, more general, to s...
Andrzej Cegielski, Agnieszka Suchocka
COMCOM
2010
118views more  COMCOM 2010»
13 years 6 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...