Sciweavers

4303 search results - page 72 / 861
» Are We There Yet
Sort
View
101
Voted
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 1 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
CHI
1996
ACM
15 years 5 months ago
Email Overload: Exploring Personal Information Management of Email
Email is one of the most successful computer applications yet devised. Our empirical data show however, that although email was originally designed as a communications application...
Steve Whittaker, Candace L. Sidner
131
Voted
SIAMCOMP
2011
14 years 7 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
104
Voted
JANCL
2007
86views more  JANCL 2007»
15 years 22 days ago
Constructive knowledge: what agents can achieve under imperfect information
We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than ...
Wojciech Jamroga, Thomas Ågotnes
77
Voted
JETAI
2010
56views more  JETAI 2010»
14 years 11 months ago
Warning: statistical benchmarking is addictive. Kicking the habit in machine learning
Algorithm performance evaluation is so entrenched in the Machine Learning community that one could call it an addiction. Like most addictions, it is harmful and very difficult to ...
Chris Drummond, Nathalie Japkowicz