Sciweavers

1578 search results - page 90 / 316
» Algorithmic randomness of continuous functions
Sort
View
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
15 years 10 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
ICASSP
2011
IEEE
14 years 1 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
BIOADIT
2004
Springer
15 years 3 months ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
GECCO
2004
Springer
15 years 3 months ago
Self Adaptation of Operator Rates in Evolutionary Algorithms
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...
Jonatan Gomez
EOR
2007
101views more  EOR 2007»
14 years 9 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme