2767 search results - page 199 / 554 » Universal Exponentiation Algorithm |
120
click to vote
IWCMC
2006
ACM
15 years 8 months 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...
101
click to vote
COCO
2004
Springer
15 years 7 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...
112
click to vote
GECCO
2003
Springer
15 years 7 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 ...
LICS
1997
IEEE
15 years 6 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
148
click to vote
IJCAI
2007
15 years 3 months ago
2007
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...