16430 search results - page 420 / 3286 » On Computable Tree Functions |
287
click to vote
GPEM
2011
15 years 1 months ago
2011
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 appropr...
189
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
166
click to vote
NDSS
2003
IEEE
16 years 3 days ago
2003
IEEE
A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. It has been sugge...
362
click to vote
Book
"These are the lecture notes accompanying the course Introduction to Functional
Programming, which I taught at Cambridge University in the academic year 1996/1997."
167
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...