Sciweavers

96 search results - page 6 / 20
» Algorithmic Verification of Single-Pass List Processing Prog...
Sort
View
CONCUR
2006
Springer
15 years 1 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
77
Voted
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 3 months ago
Improving the human readability of features constructed by genetic programming
The use of machine learning techniques to automatically analyse data for information is becoming increasingly widespread. In this paper we examine the use of Genetic Programming a...
Matthew Smith, Larry Bull
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 4 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai
PPOPP
2012
ACM
13 years 5 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
MP
2007
145views more  MP 2007»
14 years 9 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz