Sciweavers

1541 search results - page 73 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
GLOBECOM
2007
IEEE
14 years 3 months ago
Opportunistic Access with Random Subchannel Backoff (OARSB) for OFDMA Uplink
Abstract— A distributed medium access control (MAC) algorithm for uplink OFDMA networks under the IEEE 802.16 framework is proposed and analyzed in this work. We present a simple...
Yu-Jung Chang, Feng-Tsun Chien, C. C. Jay Kuo
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 10 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
RSA
2006
68views more  RSA 2006»
13 years 9 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 1 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze