975 search results - page 20 / 195 » Locality Optimization for Program Instances |
AIPS
2010
14 years 12 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
LCR
1998
Springer
15 years 1 months ago
1998
Springer
Programs accessing disk-resident arrays, called out-of-core programs, perform poorly in general due to an excessive number of I/O calls and insufficient help from compilers. In ord...
101
click to vote
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
AAAI
1997
14 years 11 months ago
1997
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...