2479 search results - page 171 / 496 » Quantum complexity theory |
192
click to vote
CASC
2006
Springer
15 years 10 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
157
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...
154
click to vote
DLOG
2006
15 years 8 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...
177
click to vote
AAAI
1994
15 years 8 months ago
1994
We present a formal theory of model-based testing, an algorithm for test generation based on it, and outline how testing is implemented by a diagnostic engine. The key to making t...
149
click to vote
COLING
1992
15 years 8 months ago
1992
This paper focuses on a theory of tense and aspect (the representation of time in natural language) that attempts a formM representation of the relevant liltguistic devices as imp...