7978 search results - page 239 / 1596 » Representation before computation |
168
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
163
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
180
click to vote
ENTCS
2011
15 years 1 months ago
2011
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
161
click to vote
SIGECOM
2006
ACM
16 years 16 days ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
156
click to vote
SIGECOM
2004
ACM
16 years 11 hour ago
2004
ACM
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...