1884 search results - page 55 / 377 » Simple Algorithm for Simple Timed Games |
ICMCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper, we propose to use a simple packet servicing algorithm suitable for servicing bursty real-time multimedia traffic streams in packet-switched networks. These real-tim...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
— We introduce spectral shaping of timing mismatches in time-interleaved analog-to-digital converters (TIADCs). We show how to reorder the channel ADC sequence in order to achiev...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...