Sciweavers

2519 search results - page 62 / 504
» Martingales and Locality in Distributed Computing
Sort
View
ALGOSENSORS
2006
Springer
13 years 10 months ago
Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks
Abstract. This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least onc...
Volker Turau
CCGRID
2002
IEEE
14 years 1 months ago
Agent-Based Resource Management for Grid Computing
It is envisaged that the grid infrastructure will be a large-scale distributed software system that will provide high-end computational and storage capabilities to differentiated ...
Junwei Cao, Daniel P. Spooner, James D. Turner, St...
COREGRID
2007
Springer
14 years 2 months ago
Co-Allocating Compute and Network Resources
Distributed applications or workflows need to access and use compute, storage and network resources simultaneously or chronologically coordinated respectively. Examples are distri...
Thomas Eickermann, Lidia Westphal, Oliver Wäl...
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 2 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 7 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...