Sciweavers

147 search results - page 2 / 30
» The Computational Complexity of Quantified Reciprocals
Sort
View
COGSCI
2010
160views more  COGSCI 2010»
13 years 5 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
Jakub Szymanik, Marcin Zajenkowski
IANDC
2006
83views more  IANDC 2006»
13 years 5 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
JSAT
2006
126views more  JSAT 2006»
13 years 5 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
IEEEARES
2010
IEEE
14 years 18 days ago
A Complexity Based Model for Quantifying Forensic Evidential Probabilities
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
Richard E. Overill, Jantje A. M. Silomon, Kam-Pui ...
CHI
2008
ACM
14 years 6 months ago
Quantifying adaptation parameters for information support of trauma teams
Trauma centers are stressful, noisy and dynamic environments, with many people performing complex tasks, and with little in the way of information support. Information must be pri...
Aleksandra Sarcevic, Michael E. Lesk, Ivan Marsic,...