3780 search results - page 228 / 756 » Algorithms for Game Metrics |
204
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
189
click to vote
ECML
2004
Springer
16 years 16 days ago
2004
Springer
In this paper we present a boosting approach to multiple instance learning. As weak hypotheses we use balls (with respect to various metrics) centered at instances of positive bags...
143
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresp...
206
click to vote
IPL
2008
15 years 6 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
208
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...