Sciweavers

5115 search results - page 264 / 1023
» On Randomized Lanczos Algorithms
Sort
View
CSCLP
2005
Springer
16 years 19 days ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels
DAM
2010
120views more  DAM 2010»
15 years 7 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
ICASSP
2011
IEEE
14 years 11 months ago
A reweighted least squares algorithm for detection of QAM signaling in MIMO channels
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
Katsumi Konishi, Toshihiro Furukawa
GECCO
2006
Springer
447views Optimization» more  GECCO 2006»
15 years 10 months ago
Candlestick stock analysis with genetic algorithms
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
Peter Belford
ICDCSW
2008
IEEE
16 years 1 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li