Sciweavers

5128 search results - page 18 / 1026
» When Abstraction Fails
Sort
View
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
14 years 1 months ago
Better with Byzantine: Manipulation-Optimal Mechanisms
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...
Abraham Othman, Tuomas Sandholm
JSAC
2010
113views more  JSAC 2010»
13 years 5 months ago
On counteracting Byzantine attacks in network coded peer-to-peer networks
Abstract—Random linear network coding can be used in peerto-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are ...
MinJi Kim, Luísa Lima, Fang Zhao, Joã...
RV
2010
Springer
172views Hardware» more  RV 2010»
13 years 5 months ago
Recovery Tasks: An Automated Approach to Failure Recovery
Abstract. We present a new approach for developing robust software applications that breaks dependences on the failed parts of an application’s execution to allow the rest of the...
Brian Demsky, Jin Zhou, William Montaz
ICSE
2008
IEEE-ACM
14 years 7 months ago
Formal concept analysis applied to fault localization
One time-consuming task in the development of software is debugging. Recent work in fault localization crosschecks traces of correct and failing execution traces, it implicitly se...
Peggy Cellier
AGP
2010
IEEE
13 years 10 months ago
Agents, Multi-Agent Systems and Declarative Programming: What, When, Where, Why, Who, How?
This chapter tackles the relation between declarative languages and multi-agent systems by following the dictates of the five Ws (and one H) that characterize investigations. The ...
Matteo Baldoni, Cristina Baroglio, Viviana Mascard...