5995 search results - page 423 / 1199 » Algorithmic Game Theory |
209
click to vote
CCS
2011
ACM
14 years 7 months ago
2011
ACM
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
180
click to vote
COLT
2008
Springer
15 years 9 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
241
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
209
click to vote
PAAMS
2010
Springer
16 years 14 days ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
185
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...