2477 search results - page 94 / 496 » Parallelizing Functional Programs by Generalization |
123
click to vote
PPOPP
2011
ACM
14 years 20 days ago
2011
ACM
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an approp...
182
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily availa...
ESOP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...