3192 search results - page 623 / 639 » The minimum latency problem |
INFOCOM
2002
IEEE
14 years 12 days ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
STOC
2010
ACM
14 years 10 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
ICWE
2010
Springer
14 years 8 days ago
2010
Springer
: AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Persone, Ningfang Mi, Evgenia Smirn...
COSIT
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we propose the use of small global memory for a viewer’s immediate surroundings to assist in recognising places that have been visited previously. We call this glob...