Sciweavers

1016 search results - page 159 / 204
» Optimized algorithms for multi-agent routing
Sort
View
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 6 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
DAC
1999
ACM
15 years 6 months ago
Buffer Insertion with Accurate Gate and Interconnect Delay Computation
Buffer insertion has become a critical step in deep submicron design, and several buffer insertion/sizing algorithms have been proposed in the literature. However, most of these m...
Charles J. Alpert, Anirudh Devgan, Stephen T. Quay
WSC
2008
15 years 4 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
INFOCOM
2010
IEEE
15 years 13 days ago
On Scheduling for Minimizing End-to-End Buffer Usage over Multihop Wireless Networks
—While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) ...
V. J. Venkataramanan, Xiaojun Lin, Lei Ying, Sanja...
ICC
2009
IEEE
14 years 11 months ago
A Multicost Approach to Online Impairment-Aware RWA
Abstract--We design and implement a multicost impairmentaware routing and wavelength assignment algorithm for online traffic. In transparent optical networks the quality of a trans...
Kostas Christodoulopoulos, Konstantinos Manousakis...