Sciweavers

2343 search results - page 372 / 469
» The Locomotive Routing Problem
Sort
View
ESANN
2003
15 years 6 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
151
Voted
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 4 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
CCR
2008
88views more  CCR 2008»
15 years 4 months ago
My ten favorite "practical theory" papers
As the saying goes, "In theory there is no difference between theory and practice. But, in practice, there is." Networking research has a wealth of good papers on both s...
Jennifer Rexford
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 4 months ago
Crosstalk-free Conjugate Networks for Optical Multicast Switching
High-speed photonic switching networks can switch optical signals at the rate of several terabits per second. However, they suffer from an intrinsic crosstalk problem when two opti...
Yun Deng, Tony T. Lee
CN
2007
95views more  CN 2007»
15 years 4 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...