Sciweavers

5086 search results - page 8 / 1018
» The Power of Comparative Reasoning
Sort
View
CIE
2005
Springer
14 years 1 months ago
How to Compare the Power of Computational Models
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...
Udi Boker, Nachum Dershowitz
CCS
2004
ACM
14 years 27 days ago
Comparing the expressive power of access control models
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
Mahesh V. Tripunitara, Ninghui Li
DM
1999
109views more  DM 1999»
13 years 7 months ago
Hamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
Sam Donnelly, Garth Isaak
ISLPED
1995
ACM
95views Hardware» more  ISLPED 1995»
13 years 11 months ago
Reducing the frequency of tag compares for low power I-cache design
In current processors, the cache controller, which contains the cache directory and other logic such as tag comparators, is active for each instruction fetch and is responsible fo...
Ramesh Panwar, David A. Rennels
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
14 years 22 days ago
Power efficient comparators for long arguments in superscalar processors
Traditional pulldown comparators that are used to implement associativeaddressing logic in superscalar microprocessors dissipate energy on a mismatch in any bit position in the co...
Dmitry Ponomarev, Gurhan Kucuk, Oguz Ergin, Kanad ...