Sciweavers

1416 search results - page 221 / 284
» cost 2009
Sort
View
ICLP
2009
Springer
14 years 9 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
CHI
2009
ACM
14 years 9 months ago
Undo and erase events as indicators of usability problems
One approach to reducing the costs of usability testing is to facilitate the automatic detection of critical incidents: serious breakdowns in interaction that stand out during sof...
David Akers, Matthew Simpson, Robin Jeffries, Terr...
SPAA
2009
ACM
14 years 9 months ago
Classifying peer-to-peer network coding schemes
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
Christian Ortolf, Christian Schindelhauer, Arne Va...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 9 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai