Sciweavers

15033 search results - page 255 / 3007
» Complexity Theory and Algorithms
Sort
View
PODC
2005
ACM
15 years 10 months ago
Toward a theory of transactional contention managers
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
AAECC
2006
Springer
125views Algorithms» more  AAECC 2006»
15 years 4 months ago
Combinatorial Group Theory and Public Key Cryptography
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
Vladimir Shpilrain, Gabriel Zapata
IWMM
2011
Springer
217views Hardware» more  IWMM 2011»
14 years 7 months ago
On the theory and potential of LRU-MRU collaborative cache management
The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can o...
Xiaoming Gu, Chen Ding
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
15 years 2 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
162
Voted
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
15 years 8 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz