Sciweavers

739 search results - page 107 / 148
» Sorting Algorithms
Sort
View
CCP
2011
92views more  CCP 2011»
12 years 7 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
EMO
2006
Springer
122views Optimization» more  EMO 2006»
13 years 11 months ago
Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
Many-objective optimization refers to optimization problems with a number of objectives considerably larger than two or three. In this paper, a study on the performance of the Fast...
Mario Köppen, Kaori Yoshida
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 8 months ago
A robust evolutionary framework for multi-objective optimization
Evolutionary multi-objective optimization (EMO) methodologies, suggested in the beginning of Nineties, focussed on the task of finding a set of well-converged and well-distribute...
Kalyanmoy Deb
ISCAS
2008
IEEE
191views Hardware» more  ISCAS 2008»
14 years 2 months ago
A novel approach for K-best MIMO detection and its VLSI implementation
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
Sudip Mondal, Khaled N. Salama, Wersame H. Ali
CIE
2007
Springer
14 years 1 months ago
Characterizing Programming Systems Allowing Program Self-reference
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...
John Case, Samuel E. Moelius