1884 search results - page 38 / 377 » Simple Algorithm for Simple Timed Games |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
AAAI
2012
13 years 10 days ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
100
click to vote
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...