Sciweavers

1778 search results - page 3 / 356
» On the Power of the Randomized Iterate
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 9 months ago
High-Throughput Random Access via Codes on Graphs
—Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions an...
Gianluigi Liva, Enrico Paolini, Marco Chiani
AMAI
1999
Springer
13 years 10 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
ICANN
2005
Springer
14 years 4 months ago
On Variations of Power Iteration
The power iteration is a classical method for computing the eigenvector associated with the largest eigenvalue of a matrix. The subspace iteration is an extension of the power iter...
Seungjin Choi
DAC
1995
ACM
14 years 2 months ago
Power Estimation in Sequential Circuits
Abstract A new method for power estimation in sequential circuits is presented that is based on a statistical estimation technique. By applying randomly generated input sequences t...
Farid N. Najm, Shashank Goel, Ibrahim N. Hajj
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
14 years 4 months ago
An iterative power allocation algorithm in OFDM system based on power relaxation
Abstract— We present an efficient algorithm for power allocation and bit loading in multi-user OFDM system. We starts with the close-form optimum power solution based on ideal c...
Ju Wang, Jonathan C. L. Liu