1469 search results - page 213 / 294 » Approximate polynomial decomposition |
223
click to vote
PEPM
1995
ACM
15 years 10 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
169
click to vote
AIPS
2008
15 years 8 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
157
click to vote
WSC
2008
15 years 8 months ago
2008
We develop and evaluate a semiparametric method to estimate the mean-value function of a nonhomogeneous Poisson process (NHPP) using one or more process realizations observed over...
136
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
165
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...