4372 search results - page 126 / 875 » Algorithmic Theories of Everything |
ICLP
2003
Springer
14 years 2 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
SIGECOM
2008
ACM
13 years 8 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Minimax-regret preference elicitation allows intelligent decisions to be made on behalf of people facing risky choices. Standard gamble queries, a vital tool in this type of prefe...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
This paper proposes a context-dependent case-based mechanism for selecting negotiation partners with the focus on the adaptation of similarity relations to a specific context. Th...