Sciweavers

846 search results - page 16 / 170
» The stability of paths in a dynamic network
Sort
View
4OR
2010
148views more  4OR 2010»
14 years 10 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
INFOCOM
1997
IEEE
15 years 3 months ago
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
Robert L. Carter, Mark Crovella
EOR
2006
107views more  EOR 2006»
14 years 11 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
TNC
2004
112views Education» more  TNC 2004»
15 years 1 months ago
On the Joint Use of new TCP Proposals and IP-QoS on High Bandwidth-RTT Product Paths
A very practical network problem for the effective deployment of a transatlantic computational GRID which is the current under-utilisation of the newly available fat long pipes dr...
Andrea di Donato, Peter Clarke, Frank Saka, Javier...
MST
2010
98views more  MST 2010»
14 years 10 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis