1449 search results - page 188 / 290 » Self-Randomized Exponentiation Algorithms |
160
click to vote
INFOCOM
2007
IEEE
16 years 19 days ago
2007
IEEE
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
171
click to vote
IWCMC
2006
ACM
16 years 9 days ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
146
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
158
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
298
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...