Sciweavers

2189 search results - page 336 / 438
» A Graded Applicability of Rules
Sort
View
PERCOM
2006
ACM
14 years 7 months ago
Composition Trust Bindings in Pervasive Computing Service Composition
In pervasive computing, devices or peers may implement or compose services using services from other devices or peers, and may use components from various sources. A composition t...
John Buford, Rakesh Kumar, Greg Perkins
DCC
2006
IEEE
14 years 7 months ago
Adaptive Run-Length / Golomb-Rice Encoding of Quantized Generalized Gaussian Sources with Unknown Statistics
We present a simple and efficient entropy coder that combines run-length and Golomb-Rice encoders. The encoder automatically switches between the two modes according to simple rul...
Henrique S. Malvar
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
14 years 4 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
TACAS
2010
Springer
210views Algorithms» more  TACAS 2010»
14 years 2 months ago
Automatic Analysis of Scratch-Pad Memory Code for Heterogeneous Multicore Processors
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...
Alastair F. Donaldson, Daniel Kroening, Philipp R&...
WOSP
2010
ACM
14 years 2 months ago
Analytical modeling of lock-based concurrency control with arbitrary transaction data access patterns
Nowadays the 2-Phase-Locking (2PL) concurrency control algorithm still plays a core rule in the construction of transactional systems (e.g. database systems and transactional memo...
Pierangelo di Sanzo, Roberto Palmieri, Bruno Cicia...