4372 search results - page 152 / 875 » Algorithmic Theories of Everything |
102
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
107
Voted
PDCN
2004
15 years 2 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
145
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
114
click to vote
CCS
2011
ACM
14 years 20 days 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...
COLT
2008
Springer
15 years 2 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...