4940 search results - page 112 / 988 » On the Complexity of Universal Programs |
165
click to vote
EC
2008
15 years 4 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
147
click to vote
TCS
2011
14 years 11 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
123
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Analysis of Symbolic Executions Aws Albarghouthi1 , Arie Gurfinkel2 , Ou Wei1,3 , and Marsha Chechik1 1 Department of Computer Science, University of Toronto, Canada 2 Software Eng...
163
click to vote
CONCUR
2008
Springer
15 years 6 months ago
2008
Springer
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
141
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...