1449 search results - page 52 / 290 » Self-Randomized Exponentiation Algorithms |
146
click to vote
ISPD
1997
ACM
15 years 4 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
114
click to vote
SIGCOMM
1996
ACM
15 years 4 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
128
click to vote
TEC
2008
15 years 13 days ago
2008
In general, the analysis of microarray data requires two steps: feature selection and classification. From a variety of feature selection methods and classifiers, it is difficult t...
105
Voted
ML
2002
ACM
15 years 6 days ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
104
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...