Sciweavers

2343 search results - page 166 / 469
» The Locomotive Routing Problem
Sort
View
ICML
2000
IEEE
16 years 7 months ago
Learning Subjective Functions with Large Margins
In manyoptimization and decision problems the objective function can be expressed as a linear combinationof competingcriteria, the weights of whichspecify the relative importanceo...
Claude-Nicolas Fiechter, Seth Rogers
ICC
2009
IEEE
129views Communications» more  ICC 2009»
16 years 1 months ago
Do Next Generation Networks Need Path Diversity?
—We have currently reached a phase where big shifts in the network traffic might impose to rethink the design of current architectures, and where new technologies, being pushed ...
Luca Muscariello, Diego Perino, Dario Rossi
COMPUTING
2010
15 years 3 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
AGTIVE
2007
Springer
16 years 14 days ago
Communities of Autonomous Units for Pickup and Delivery Vehicle Routing
Communities of autonomous units are being developed for formal specification and semantic analysis of systems of interacting and mobile components. The autonomous units of a commu...
Hans-Jörg Kreowski, Sabine Kuske
COMCOM
2006
120views more  COMCOM 2006»
15 years 6 months ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti