Sciweavers

2814 search results - page 294 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
98
Voted
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 4 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
78
Voted
CEC
2007
IEEE
15 years 6 months ago
A rigorous view on neutrality
Abstract—Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on t...
Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus,...
INFOCOM
2009
IEEE
15 years 7 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...
113
Voted
EVOW
2007
Springer
15 years 4 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
CORR
2004
Springer
208views Education» more  CORR 2004»
15 years 11 days ago
Business Intelligence from Web Usage Mining
The rapid e-commerce growth has made both business community and customers face a new situation. Due to intense competition on the one hand and the customer's option to choose...
Ajith Abraham