Sciweavers

29152 search results - page 352 / 5831
» A Model of Computation for MapReduce
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
IPPS
2006
IEEE
16 years 26 days ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan
DEXAW
2005
IEEE
199views Database» more  DEXAW 2005»
16 years 14 days ago
Combining Multi-Agent-System Methodologies for Organic Computing Systems
As the complexity of computing systems steadily increases, self-managing systems – as Autonomic Computing Systems (ACS) proposed by IBM – are an adequate approach to minimize ...
Holger Kasinger, Bernhard Bauer
AI
2008
Springer
15 years 7 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
CORR
2004
Springer
166views Education» more  CORR 2004»
15 years 6 months ago
A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commu...
Marie Lalire, Philippe Jorrand