Sciweavers

4897 search results - page 351 / 980
» Trust Modeling for Peer-to-Peer Based Computing Systems
Sort
View
CHARME
2005
Springer
143views Hardware» more  CHARME 2005»
16 years 5 days ago
Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
Gianfranco Ciardo, Andy Jinqing Yu
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
Pascal O. Vontobel
ATAL
2008
Springer
15 years 8 months ago
Distributed multiagent resource allocation in diminishing marginal return domains
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
Yoram Bachrach, Jeffrey S. Rosenschein
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
HPDC
2006
IEEE
16 years 21 days ago
Resource Availability Prediction in Fine-Grained Cycle Sharing Systems
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of computational resources available on the Internet. In FGCS, host computers allow guest jobs to utili...
Xiaojuan Ren, Seyong Lee, Rudolf Eigenmann, Saurab...