245 search results - page 11 / 49 » On the Average-Case Complexity of Property Testing |
114
click to vote
IOLTS
2003
IEEE
15 years 9 months ago
2003
IEEE
The paper describes a specific method for designing selfchecking checkers for m-out-of-n codes. The method is oriented to the Field Programmable Gate Arrays technology and is base...
147
click to vote
JMLR
2012
13 years 6 months ago
2012
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
112
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
128
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
173
Voted
TEC
2002
15 years 3 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...