1884 search results - page 68 / 377 » Simple Algorithm for Simple Timed Games |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
IPL
2006
14 years 10 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
DSN
2006
IEEE
15 years 4 months ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
As real-time systems become more prevalent, there is a need to guarantee that these increasingly complex systems perform as designed. One technique involves a static analysis to p...
106
Voted
PODS
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...