Sciweavers

197 search results - page 10 / 40
» Optimizing Chemotherapy Scheduling Using Local Search Heuris...
Sort
View
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
14 years 1 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
PPSN
2010
Springer
13 years 5 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
EOR
2006
128views more  EOR 2006»
13 years 7 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...
INFOCOM
2008
IEEE
14 years 1 months ago
Adding Capacity Points to a Wireless Mesh Network Using Local Search
Abstract— Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user populations. As the network usage grows, network...
Joshua Robinson, Mustafa Uysal, Ram Swaminathan, E...
CP
2001
Springer
13 years 12 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken