Sciweavers

117 search results - page 13 / 24
» What do we know about the Metropolis algorithm
Sort
View
WWW
2011
ACM
13 years 3 months ago
Generalized fact-finding
Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a ...
Jeff Pasternack, Dan Roth
ECAI
2000
Springer
14 years 26 days ago
Achieving Coordination through Combining Joint Planning and Joint Learning
There are two major approaches to activity coordination in multiagent systems. First, by endowing the agents with the capability to jointly plan, that is, to jointly generate hypot...
Gerhard Weiss
WDAG
2007
Springer
102views Algorithms» more  WDAG 2007»
14 years 2 months ago
A Denial-of-Service Resistant DHT
We consider the problem of designing scalable and robust information systems based on multiple servers that can survive even massive denial-of-service (DoS) attacks. More precisely...
Baruch Awerbuch, Christian Scheideler
KR
2010
Springer
14 years 1 months ago
One Hundred Prisoners and a Lightbulb - Logic and Computation
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
Hans P. van Ditmarsch, Jan van Eijck, William Wu
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
14 years 8 days ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo