Sciweavers

2466 search results - page 429 / 494
» Algorithms for distributed functional monitoring
Sort
View
120
Voted
SPAA
1993
ACM
15 years 4 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
113
Voted
EUROSYS
2009
ACM
15 years 4 months ago
Effective and efficient compromise recovery for weakly consistent replication
Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfor...
Prince Mahajan, Ramakrishna Kotla, Catherine C. Ma...
113
Voted
ATAL
2006
Springer
15 years 4 months ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
99
Voted
ATAL
2010
Springer
15 years 1 months ago
Deception in networks of mobile sensing agents
Recent studies have investigated how a team of mobile sensors can cope with real world constraints, such as uncertainty in the reward functions, dynamically appearing and disappea...
Viliam Lisý, Roie Zivan, Katia P. Sycara, M...
131
Voted
IM
2007
15 years 13 days ago
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as In-Degree values. This ...
Nelly Litvak, Werner R. W. Scheinhardt, Yana Volko...