Sciweavers

281 search results - page 22 / 57
» A revealed preference approach to computational complexity i...
Sort
View
ATAL
2009
Springer
14 years 3 months ago
Decommitting in multi-agent execution in non-deterministic environment: experimental approach
The process of planning in complex, multi-actor environment depends strongly on the ability of the individual actors to perform intelligent decommitment upon specific changes in ...
Jirí Vokrínek, Antonín Komend...
AAAI
2006
13 years 10 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
WWW
2008
ACM
14 years 9 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
EUROCRYPT
2010
Springer
14 years 1 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
AAAI
2012
11 years 11 months ago
Strategic Advice Provision in Repeated Human-Agent Interactions
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
Amos Azaria, Zinovi Rabinovich, Sarit Kraus, Claud...