484 search results - page 34 / 97 » Caching function calls using precise dependencies |
BIBE
2001
IEEE
14 years 1 months ago
2001
IEEE
As various genome sequencing projects have already been completed or are near completion, genome researchers are shifting their focus from structural genomics to functional genomi...
PPOPP
1999
ACM
14 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
ESOP
2003
Springer
14 years 3 months ago
2003
Springer
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
ATAL
2005
Springer
14 years 3 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
FLAIRS
2007
14 years 5 days ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...