Sciweavers

16666 search results - page 40 / 3334
» Descriptive and Computational Complexity
Sort
View
118
Voted
IJCNN
2008
IEEE
15 years 10 months ago
Dynamic logic of phenomena and cognition
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
Boris Kovalerchuk, Leonid I. Perlovsky
117
Voted
NIPS
2000
15 years 4 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...
106
Voted
WWW
2008
ACM
16 years 4 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
104
Voted
FUIN
2006
106views more  FUIN 2006»
15 years 3 months ago
Architectural Principles and Scheduling Strategies for Computing Agent Systems
The paper introduces the formal description of a computing multi-agent system (MAS), its architecture and dynamics (sections 2
Marek Grochowski, Robert Schaefer, Maciej Smolka
FOCS
1990
IEEE
15 years 7 months ago
IP=PSPACE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
Adi Shamir