19320 search results - page 36 / 3864 » On the complexity of computing determinants |
80
Voted
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
DAC
2003
ACM
2003
ACM
A complexity effective communication model for behavioral modeling of signal processing applications
15 years 10 months ago
In this paper, we argue that the address space of memory regions that participate in inter task communication is over-specified by the traditional communication models used in beh...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
JELIA
2004
Springer
15 years 3 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
73
Voted
IEEEICCI
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper describes a system capable of classifying stochastic, self-affine, nonstationary signals produced by nonlinear systems. The classification and analysis of these signals...