Sciweavers

2899 search results - page 180 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
GLOBECOM
2008
IEEE
16 years 1 months ago
Joint Scheduling and Rate Control Algorithms for Stable Throughput Maximization under Channel Estimation in Single-Hop Wireless
—We characterize the stability region of wireless, single-hop networks with time-varying imperfect channels. We define a joint scheduling and transmission rate control policy th...
Anna Pantelidou, Anthony Ephremides
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
15 years 10 months ago
New efficient algorithms for computing effective capacitance
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
Andrew B. Kahng, Sudhakar Muddu
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 10 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
ICIP
2003
IEEE
16 years 8 months ago
Optimal framework for low bit-rate block coders
Block coders are among the most common compression tools available for still images and video sequences. Their low computational complexity along with their good performance make ...
Yaakov Tsaig, Michael Elad, Gene H. Golub, Peyman ...