Sciweavers

4895 search results - page 137 / 979
» Functional Quantum Programming
Sort
View
POPL
2008
ACM
14 years 10 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
ACG
2009
Springer
14 years 4 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 11 months ago
Genetic algorithms for mentor-assisted evaluation function optimization
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...
Omid David-Tabibi, Moshe Koppel, Nathan S. Netanya...
POPL
2007
ACM
14 years 10 months ago
PADS/ML: a functional data description language
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...
Artem Gleyzer, David Walker, Kathleen Fisher, Mary...
ICFP
2006
ACM
14 years 10 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert