Sciweavers

1016 search results - page 20 / 204
» Optimized algorithms for multi-agent routing
Sort
View
OSDI
2008
ACM
14 years 7 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 2 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
ICC
2007
IEEE
14 years 1 months ago
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
Edwin Soedarmadji, Robert J. McEliece
IPPS
1999
IEEE
13 years 12 months ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 4 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller