Sciweavers

824 search results - page 27 / 165
» Weighted Low-Rank Approximations
Sort
View
ICC
2007
IEEE
136views Communications» more  ICC 2007»
14 years 2 months ago
On the Approximation of the Linear Combination of Log-Normal RVs via Pearson Type IV Distribution: Application to UWB Performanc
— Approximating the sum of Log–Normal random variables (RVs) is a long–standing open issue, in the old and recent literature, and many approaches have been proposed to deal w...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
GECCO
2008
Springer
170views Optimization» more  GECCO 2008»
13 years 9 months ago
Evolving prediction weights using evolution strategy
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
Trung Hau Tran, Cédric Sanza, Yves Duthen
DAM
2006
136views more  DAM 2006»
13 years 8 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
14 years 2 days ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
IPL
2007
114views more  IPL 2007»
13 years 8 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...