Sciweavers

1529 search results - page 92 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
ICFP
2007
ACM
16 years 4 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
161
Voted
MFCS
2009
Springer
15 years 8 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 5 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
ICASSP
2009
IEEE
15 years 1 months ago
Minimum BER beamforming in the RF domain for OFDM transmissions and linear receivers
In this paper, we study transmission schemes for a novel OFDMbased MIMO system which performs adaptive signal combining in radio-frequency (RF). Specifically, we consider the prob...
Javier Vía, Victor Elvira, Ignacio Santamar...
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
15 years 10 months ago
Analyzing Metric Space Indexes: What For?
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
Gonzalo Navarro