1884 search results - page 125 / 377 » Simple Algorithm for Simple Timed Games |
142
click to vote
PRESENCE
1998
15 years 2 months ago
1998
Many multiresolution methods have been proposed. Most of them emphasize accuracy and hence are slow. Some methods may be fast, but they may not preserve the geometry of the model....
113
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
116
Voted
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
105
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
130
click to vote
SOFSEM
2010
Springer
15 years 11 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...