7103 search results - page 288 / 1421 » Components and Generative Programming |
120
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Abstract. The combination of a language with ne-grain implicit parallelism and a data
ow evaluation scheme is suitable for high-level programming on massively parallel architectur...
139
click to vote
ENTCS
2006
15 years 2 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
131
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
120
Voted
IFL
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
120
Voted
LOPSTR
1994
Springer
15 years 6 months ago
1994
Springer
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...