392 search results - page 3 / 79 » Reversal Complexity Revisited |
SOFSEM
2001
Springer
13 years 10 months ago
2001
Springer
ICGI
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
RSFDGRC
2005
Springer
13 years 11 months ago
2005
Springer
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,...
HPCC
2007
Springer
14 years 13 days ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
AAAI
2012
11 years 8 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...