Sciweavers

16666 search results - page 268 / 3334
» Descriptive and Computational Complexity
Sort
View
AUSAI
1999
Springer
15 years 11 months ago
Feasibility of Optimised Disjunctive Reasoning for Approximate Matching
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...
Ian Horrocks, Lin Padgham, Laura Thomson
WCNC
2010
IEEE
15 years 10 months ago
Experiences and Lessons from Implementing a Wireless Sensor Network MAC Protocol in the Castalia Simulator
—We describe our experience from the implementation of the T-MAC protocol for wireless sensor networks in the open-source Castalia simulator. Notwithstanding the popularity of th...
Yuri Tselishchev, Athanassios Boulis, Lavy Libman
RSFDGRC
2005
Springer
208views Data Mining» more  RSFDGRC 2005»
16 years 3 days ago
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
Dan Wu, Cory J. Butz
COGSCI
2004
82views more  COGSCI 2004»
15 years 6 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
CAV
2009
Springer
104views Hardware» more  CAV 2009»
16 years 7 months ago
SPEED: Symbolic Complexity Bound Analysis
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
Sumit Gulwani