Sciweavers

638 search results - page 37 / 128
» Robust Topology Representing Networks
Sort
View
COCOA
2009
Springer
15 years 6 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...
4OR
2005
104views more  4OR 2005»
14 years 11 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
ETM
2010
163views Economy» more  ETM 2010»
15 years 1 months ago
Estimating AS Relationships for Application-Layer Traffic Optimization
The relationships among autonomous systems (ASes) on the Internet are categorized into two major types: transit and peering. We propose a method for quantifying AS' network si...
Hirochika Asai, Hiroshi Esaki
JNW
2007
86views more  JNW 2007»
14 years 11 months ago
Reliable Actuation in Sensor Networks
Abstract—We present a protocol that uses a publish/subscribe approach to perform reliable but efficient actuation over a sensor network whose topology may change. Actuation on a...
Sean Rooney, Luis Garcés-Erice
PADS
2004
ACM
15 years 5 months ago
Space-Parallel Network Simulations Using Ghosts
We discuss an approach for creating a federated network simulation that eases the burdens on the simulator user that typically arise from more traditional methods for defining sp...
George F. Riley, Talal M. Jaafar, Richard M. Fujim...