16666 search results - page 94 / 3334 » Descriptive and Computational Complexity |
112
click to vote
ISVC
2007
Springer
15 years 10 months ago
2007
Springer
Video event understanding requires a formalism that can model complex logical temporal and spatial relations between composing sub-events. In this paper we argue that the Petri-Net...
129
click to vote
ANTS
2004
Springer
15 years 9 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
104
click to vote
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper focuses on an XML-based framework for the description of grid environments and complex grid applications. A so-called Grid Job Handler is used to manage these ...
116
click to vote
DLOG
2006
15 years 5 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
119
click to vote
ECBS
1996
IEEE
15 years 8 months ago
1996
IEEE
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...