461 search results - page 73 / 93 » Higher Kurtz randomness |
88
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
101
click to vote
KAIS
2008
14 years 9 months ago
2008
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently, we have been approached by Texas Commission on En...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Most of the online multimedia collections, such as picture galleries or video archives, are categorized in a fully manual process, which is very expensive and may soon be infeasib...
65
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...