16430 search results - page 209 / 3286 » On Computable Tree Functions |
160
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
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...
103
click to vote
ACL
1998
15 years 5 months ago
1998
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...
106
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
144
click to vote
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
Web communities are web virtual broadcasting spaces where people can freely discuss anything. While such communities function as discussion boards, they have even greater value as...
146
click to vote
ISCAPDCS
2003
15 years 5 months ago
2003
Data intensive service functions such as memory allocation/de-allocation, data prefetching, and data relocation can pollute processor cache in conventional systems since the same ...