2479 search results - page 170 / 496 » A Computational Theory of Working Memory |
148
click to vote
CG
2002
Springer
15 years 5 months ago
2002
Springer
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...
156
click to vote
SAC
2002
ACM
15 years 5 months ago
2002
ACM
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...
132
Voted
SAC
2006
ACM
15 years 11 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
183
click to vote
IPPS
2009
IEEE
16 years 5 days ago
2009
IEEE
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
158
click to vote
IAJIT
2010
15 years 4 months ago
2010
: The coding gain of the H.264/AVC video encoder mainly comes from the new incorporated prediction tools. However, their enormous computation and ultrahigh memory bandwidth are the...