Sciweavers

8009 search results - page 10 / 1602
» cans 2005
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
14 years 3 months 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
PERCOM
2005
ACM
14 years 9 months ago
Traditional Systems Can Work Well for Pervasive Applications. A Case Study: Plan 9 from Bell Labs Becomes Ubiquitous
There is a huge effort in ongoing research on new middleware platforms and new distributed services to support ubiquitous environments and pervasive applications. Most research pr...
Francisco J. Ballesteros, Gorka Guardiola Muzquiz,...
CONCUR
2005
Springer
14 years 3 months ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
EUROPAR
2005
Springer
14 years 3 months ago
Faults in Large Distributed Systems and What We Can Do About Them
Scientists are increasingly using large distributed systems built from commodity off-the-shelf components to perform scientific computation. Grid computing has expanded the scale ...
George Kola, Tevfik Kosar, Miron Livny
ITRUST
2005
Springer
14 years 3 months ago
Can We Manage Trust?
The term trust management suggests that trust can be managed, for example by creating trust, by assessing trustworthiness, or by determining optimal decisions based on specific le...
Audun Jøsang, Claudia Keser, Theodosis Dimi...