Sciweavers

2110 search results - page 131 / 422
» What is the complexity of a distributed computing system
Sort
View
174
Voted
ATAL
2010
Springer
15 years 5 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
CF
2004
ACM
15 years 10 months ago
A framework for resource discovery in pervasive computing for mobile aware task execution
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
K. Kalapriya, S. K. Nandy, Deepti Srinivasan, R. U...
ENTCS
2008
103views more  ENTCS 2008»
15 years 4 months ago
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
Stefan Blom, Boudewijn R. Haverkort, Matthias Kunt...
ATAL
2010
Springer
15 years 5 months ago
An architecture for modular distributed simulation with agent-based models
Agent-based simulations are an increasingly popular means of exploring and understanding complex social systems. In order to be useful, these simulations must capture a range of a...
David Scerri, Alexis Drogoul, Sarah L. Hickmott, L...
FGCS
2008
127views more  FGCS 2008»
15 years 4 months ago
Monte Carlo methods for matrix computations on the grid
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
Simon Branford, Cihan Sahin, Ashish Thandavan, Chr...