Sciweavers

12264 search results - page 53 / 2453
» Analysis of the rubberband algorithm
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 2 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
NJC
2006
125views more  NJC 2006»
13 years 7 months ago
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...
Assefaw Hadish Gebremedhin, Mohamed Essaïdi, ...
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
13 years 11 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
DATE
2005
IEEE
93views Hardware» more  DATE 2005»
14 years 1 months ago
A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
ShengYu Shen, Ying Qin, Sikun Li
IJCAI
1993
13 years 9 months ago
Average-Case Analysis of a Nearest Neighbor Algorithm
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
Pat Langley, Wayne Iba