Sciweavers

1278 search results - page 51 / 256
» The Complexity of Weighted Boolean
Sort
View
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama
IEEEICCI
2007
IEEE
14 years 2 months ago
On Experiments for Measuring Cognitive Weights for Software Control Structures
Shao and Wang have proposed a cognitive complexity measure[8] as a metric that can be used for estimating the comprehension effort for understanding software written in imperative...
Volker Gruhn, Ralf Laue
COMPLEX
2009
Springer
13 years 11 months ago
Using the Weighted Rich-Club Coefficient to Explore Traffic Organization in Mobility Networks
Abstract. The aim of a transportation system is to enable the movement of goods or persons between any two locations with the highest possible efficiency. This simple principle ins...
Jose J. Ramasco, Vittoria Colizza, Pietro Panzaras...
IPL
2006
79views more  IPL 2006»
13 years 7 months ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
MOC
2002
131views more  MOC 2002»
13 years 7 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson