2767 search results - page 129 / 554 » Universal Exponentiation Algorithm |
109
click to vote
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
123
click to vote
ISPD
1997
ACM
15 years 2 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...
SIGCOMM
1996
ACM
15 years 2 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...
104
click to vote
TEC
2008
14 years 10 months 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...
ML
2002
ACM
14 years 9 months 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...