4940 search results - page 388 / 988 » On the Complexity of Universal Programs |
215
Voted
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
297
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
202
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
168
click to vote
PADL
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
168
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
With the increasing trend of microprocessor manufacturers to rely on parallelism to increase their products’ performance, there is an associated increasing need for simple techn...