1568 search results - page 86 / 314 » The problem of examination questions in algorithmics |
142
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
140
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
158
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
114
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
: The search for patterns or motifs in data represents a problem area of key interest to finance and economic researchers. In this paper we introduce the Motif Tracking Algorithm, ...
132
click to vote
DSN
2005
IEEE
15 years 10 months ago
2005
IEEE
Designing a distributed fault tolerance algorithm requires careful analysis of both fault models and diagnosis strategies. A system will fail if there are too many active faults, ...