Sciweavers

2555 search results - page 233 / 511
» Quantifiers and Working Memory
Sort
View
COGSCI
2004
78views more  COGSCI 2004»
15 years 4 months ago
Varieties of sameness: the impact of relational complexity on perceptual comparisons
The fundamental relations that underlie cognitive comparisons--"same" and "different"--can be demultiple levels of abstraction, which vary in relational comple...
James K. Kroger, Keith J. Holyoak, John E. Hummel
141
Voted
CG
2002
Springer
15 years 4 months ago
PDS-PN: A New Proof-Number Search Algorithm
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaa...
SAC
2002
ACM
15 years 4 months ago
Automatic code generation for executing tiled nested loops onto parallel architectures
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
Georgios I. Goumas, Maria Athanasaki, Nectarios Ko...
NN
2007
Springer
15 years 4 months ago
From memory-based decisions to decision-based movements: A model of interval discrimination followed by action selection
The interval discrimination task is a classical experimental paradigm that is employed to study working memory and decision making and typically involves four phases. First, the s...
Prashant Joshi
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 3 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv