3328 search results - page 320 / 666 » On Plateaued Functions and Their Constructions |
188
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
229
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
177
click to vote
P2P
2007
IEEE
16 years 1 months ago
2007
IEEE
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
172
click to vote
PPOPP
2005
ACM
16 years 10 days ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
215
click to vote
EMSOFT
2005
Springer
16 years 9 days ago
2005
Springer
Real-time systems have reached a level of complexity beyond the scaling capability of the low-level or restricted languages traditionally used for real-time programming. While Met...