Sciweavers

971 search results - page 17 / 195
» Planning with Reduced Operator Sets
Sort
View
MICRO
2008
IEEE
111views Hardware» more  MICRO 2008»
15 years 4 months ago
Reducing the harmful effects of last-level cache polluters with an OS-level, software-only pollute buffer
It is well recognized that LRU cache-line replacement can be ineffective for applications with large working sets or non-localized memory access patterns. Specifically, in lastle...
Livio Soares, David K. Tam, Michael Stumm
AIPS
1996
14 years 11 months ago
Computing Parameter Domains as an Aid to Planning
Weshowthat by inferring parametexdomainsof planningoperators,given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process...
Alfonso Gerevini, Lenhart K. Schubert
AIPS
2011
14 years 1 months ago
A Polynomial All Outcome Determinization for Probabilistic Planning
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...
Thomas Keller, Patrick Eyerich
INTERNET
2007
105views more  INTERNET 2007»
14 years 9 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
14 years 11 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen