Sciweavers

438 search results - page 62 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
IPPS
2000
IEEE
14 years 5 days ago
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
Qian-Ping Gu, Shietung Peng
IWCLS
2007
Springer
14 years 1 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
ATAL
2009
Springer
14 years 2 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
ICCAD
1994
IEEE
151views Hardware» more  ICCAD 1994»
13 years 12 months ago
Multi-way VLSI circuit partitioning based on dual net representation
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propo...
Jason Cong, Wilburt Labio, Narayanan Shivakumar