2313 search results - page 23 / 463 » On Heuristic Time Hierarchies |
104
click to vote
FLAIRS
2008
15 years 2 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
HPDC
2006
IEEE
15 years 5 months ago
2006
IEEE
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
102
click to vote
IJNSEC
2011
14 years 6 months ago
2011
Shen and Chen proposed a novel key management scheme for dynamic access control in a hierarchy. In this article, the authors shall present an improved version of Shen and Chen’s...
SC
2005
ACM
15 years 5 months ago
2005
ACM
Inlining improves the performance of programs by reducing the overhead of method invocation and increasing the opportunities for compiler optimization. Incorrect inlining decision...
AAAI
2010
15 years 1 months ago
2010
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...