134 search results - page 21 / 27 » On the Complexity of Computing Values of Restricted Games |
180
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
105
click to vote
CSR
2007
Springer
15 years 3 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
117
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
DAWAK
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In ...