3495 search results - page 111 / 699 » On the random satisfiable process |
95
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
100
click to vote
JUCS
2008
15 years 24 days ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
83
Voted
IM
2007
15 years 22 days ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
102
click to vote
SIGSOFT
2004
ACM
16 years 1 months ago
2004
ACM
Exploring alternative options is at the heart of the requirements and design processes. Different alternatives contribute to different degrees of achievement of non-functional goa...
102
Voted
ICDCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as Latency Gradated Ove...