3136 search results - page 307 / 628 » Genetic programming theory |
132
click to vote
ICALP
1999
Springer
15 years 10 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
210
click to vote
FP
1991
15 years 9 months ago
1991
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
173
click to vote
JFP
2002
15 years 5 months ago
2002
Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they...
175
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
A fully automatic, compiler-driven approach to parallelisation can result in unpredictable time and space costs for compiled code. On the other hand, a fully manual approach to pa...
147
click to vote
ISAAC
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...