Sciweavers

2110 search results - page 15 / 422
» What is the complexity of a distributed computing system
Sort
View
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 23 days 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...
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
14 years 26 days ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
UM
2001
Springer
13 years 11 months ago
User Modelling in I-Help: What, Why, When and How
This paper describes user modelling in I-Help, a system to facilitate communication amongst learners. There are two I-Help components: Private and Public Discussions. In the Privat...
Susan Bull, Jim E. Greer, Gordon I. McCalla, Lori ...
BIRTHDAY
2003
Springer
14 years 18 days ago
Distributed Cooperation and Adversity: Complexity Trade-Offs
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
Chryssis Georgiou, Alexander Russell, Alexander A....
IDT
2007
83views more  IDT 2007»
13 years 7 months ago
Negotiating flexible agreements by combining distributive and integrative negotiation
This paper presents an approach to automated negotiation between agents which attempts to combine the advantages of a co-operative value adding approach, with the reality that neg...
Quoc Bao Vo, Lin Padgham, Lawrence Cavedon