Sciweavers

11371 search results - page 97 / 2275
» The network inhibition problem
Sort
View
JPDC
2006
81views more  JPDC 2006»
15 years 6 months ago
Implications of virtualization on Grids for high energy physics applications
The simulations used in the field of high energy physics are compute intensive and exhibit a high level of data parallelism. These features make such simulations ideal candidates ...
Laura Gilbert, Jeff Tseng, Rhys Newman, Saeed Iqba...
NETWORKS
2010
15 years 4 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
ICNS
2009
IEEE
15 years 4 months ago
Evaluation of Free-Riding Traffic Problem in Overlay Routing and Its Mitigation Method
Recent research on overlay networks has revealed that user-perceived network performance could be improved by an overlay routing mechanism. The effectiveness of overlay routing is ...
Go Hasegawa, Yuichiro Hiraoka, Masayuki Murata
NETWORKS
2010
15 years 4 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
NETWORKS
2010
15 years 4 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum