Sciweavers

828 search results - page 128 / 166
» Bounded Hairpin Completion
Sort
View
73
Voted
EOR
2010
99views more  EOR 2010»
14 years 9 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
DM
2008
106views more  DM 2008»
14 years 9 months ago
Chromatic capacity and graph operations
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
Jack Huizenga
71
Voted
COR
2006
72views more  COR 2006»
14 years 9 months ago
Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...
Said Fathy El-Zoghdy, Hisao Kameda, Jie Li
CN
2007
116views more  CN 2007»
14 years 9 months ago
Joint call and packet QoS in cellular packet networks
This paper proposes a novel call admission control scheme capable of providing a combination of call and packet level quality of service requirements in cellular packet networks. ...
Majid Ghaderi, Raouf Boutaba, Gary W. Kenward
CN
2007
111views more  CN 2007»
14 years 9 months ago
Quantile sampling for practical delay monitoring in Internet backbone networks
Point-to-point delay is an important network performance measure as it captures service degradations caused by various events. We study how to measure and report delay in a concis...
Baek-Young Choi, Sue B. Moon, Rene L. Cruz, Zhi-Li...