237 search results - page 12 / 48 » Just enough tabling |
AAAI
2004
13 years 9 months ago
2004
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
ECOOPW
1999
Springer
13 years 11 months ago
1999
Springer
Moore’s Law is pushing us inevitably towards a world of pervasive, wireless, spontaneously networked computing devices. Whatever these devices do, they will have to talk to and n...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
CHI
2010
ACM
14 years 2 months ago
2010
ACM
We present a novel integration of a brain-computer interface (BCI) with a multi-touch surface. BCIs based on the P300 paradigm often use a visual stimulus of a flashing character ...