Sciweavers

1016 search results - page 147 / 204
» Optimized algorithms for multi-agent routing
Sort
View
ATMOS
2010
134views Optimization» more  ATMOS 2010»
14 years 8 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
DAC
2006
ACM
15 years 10 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
VTC
2006
IEEE
112views Communications» more  VTC 2006»
15 years 3 months ago
Adaptive Resource Allocation Based on Channel Information in Multihop OFDM Systems
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
ChiSung Bae, Dong-Ho Cho
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 9 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin
CN
2008
176views more  CN 2008»
14 years 9 months ago
ARQ-based cross-layer optimization for wireless multicarrier transmission on cognitive radio networks
The primary feature of cognitive radios for wireless communication systems is the capability to optimize the relevant communication parameters given a dynamic wireless channel env...
Alexandre de Baynast, Petri Mähönen, Mar...