687 search results - page 85 / 138 » Feature (De)composition in Functional Programming |
155
click to vote
ASPLOS
2008
ACM
15 years 4 months ago
2008
ACM
Today's system programmers go to great lengths to extend the languages in which they program. For instance, system-specific compilers find errors in Linux and other systems, ...
128
click to vote
IJCAI
2007
15 years 3 months ago
2007
We explore an application to the game of Go of a reinforcement learning approach based on a linear evaluation function and large numbers of binary features. This strategy has prov...
113
click to vote
POPL
2010
ACM
15 years 12 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
128
click to vote
CASES
2003
ACM
15 years 7 months ago
2003
ACM
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
123
click to vote
GPEM
2008
15 years 2 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...