8196 search results - page 113 / 1640 » Computational Modeling and Complexity Science |
151
click to vote
COGSCI
2010
15 years 6 months ago
2010
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...
162
click to vote
SOFSEM
2001
Springer
15 years 10 months ago
2001
Springer
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
199
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
