Sciweavers

1528 search results - page 249 / 306
» Performance Assertion Checking
Sort
View
AAAI
1996
13 years 9 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
DAGSTUHL
1990
13 years 9 months ago
Parallel Rule-Firing Production Systems
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
Daniel Neimann
CHES
2010
Springer
210views Cryptology» more  CHES 2010»
13 years 8 months ago
Flash Memory 'Bumping' Attacks
This paper introduces a new class of optical fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually s...
Sergei Skorobogatov
ESORICS
2010
Springer
13 years 8 months ago
Readers Behaving Badly - Reader Revocation in PKI-Based RFID Systems
Abstract. Recent emergence of RFID tags capable of performing public key operations motivates new RFID applications, including electronic travel documents, identification cards and...
Rishab Nithyanand, Gene Tsudik, Ersin Uzun
ISLPED
2010
ACM
169views Hardware» more  ISLPED 2010»
13 years 8 months ago
TurboTag: lookup filtering to reduce coherence directory power
On-chip coherence directories of today's multi-core systems are not energy efficient. Coherence directories dissipate a significant fraction of their power on unnecessary loo...
Pejman Lotfi-Kamran, Michael Ferdman, Daniel Crisa...