1884 search results - page 318 / 377 » Simple Algorithm for Simple Timed Games |
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
IWDC
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. For time-constrained applications, repair-server-based active local recovery approaches can be valuable in providing low-latency reliable multicast service. However, an a...
ALGORITHMICA
2010
14 years 10 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
JDA
2007
14 years 10 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
111
click to vote
SIGMETRICS
2011
ACM
14 years 25 days ago
2011
ACM
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...