2370 search results - page 15 / 474 » The Characterization of Data-Accumulating Algorithms |
PODS
2002
ACM
14 years 9 months ago
2002
ACM
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
CP
2006
Springer
14 years 1 months ago
2006
Springer
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynam...
ANOR
2008
13 years 9 months ago
2008
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an a...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...