5084 search results - page 300 / 1017 » Proving Possibility Properties |
193
click to vote
PARA
2004
Springer
16 years 8 hour ago
2004
Springer
Abstract. By simulating a real computer it is possible to gain a detailed knowledge of the cache memory utilization of an application, e.g., a partial differential equation (PDE) s...
143
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
176
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...
154
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
We present a technique for fast estimation of the power consumed by the cache and bus sub-system of a parameterized system-on-a-chip design for a given application. The technique ...
181
click to vote
ICPP
1993
IEEE
15 years 10 months ago
1993
IEEE
Abstract — In MIMD (Multiple Instruction stream, Multiple Data stream) execution, each processor has its own state. Although these states are generally considered to be independe...