Sciweavers

881 search results - page 22 / 177
» connection 2004
Sort
View
NETWORKING
2004
13 years 11 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
NOSSDAV
2004
Springer
14 years 3 months ago
Client-centered energy savings for concurrent HTTP connections
—In mobile devices, the wireless network interface card (WNIC) consumes a significant portion of overall system energy. One way to reduce energy consumed by a WNIC is to transit...
Haijin Yan, Rupa Krishnan, Scott A. Watterson, Dav...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICTAC
2004
Springer
14 years 3 months ago
Object Connectivity and Full Abstraction for a Concurrent Calculus of Classes
onnectivity and Full Abstraction for a Concurrent Calculus of Classes⋆ nded Abstract — Erika ´Abrah´am2 , Marcello M. Bonsangue3 , Frank S. de Boer4 , and Martin Steffen1 1 ...
Erika Ábrahám, Marcello M. Bonsangue...
BMCBI
2004
73views more  BMCBI 2004»
13 years 9 months ago
Use of a structural alphabet for analysis of short loops connecting repetitive structures
Background: Because loops connect regular secondary structures, analysis of the former depends directly on the definition of the latter. The numerous assignment methods, however, ...
Laurent Fourrier, Cristina Benros, Alexandre G. de...