7289 search results - page 1063 / 1458 » A Dependent Set Theory |
195
click to vote
SIGECOM
2010
ACM
16 years 12 days ago
2010
ACM
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
239
click to vote
FUN
2010
Springer
16 years 12 days ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
213
click to vote
WIKIS
2009
ACM
16 years 7 days ago
2009
ACM
Learning “the wiki way”, learning through wikis is a form of selfregulated learning that is independent of formal learning settings and takes place in a community of knowledge...
197
click to vote
ALT
2000
Springer
15 years 12 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
196
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...