Sciweavers

552 search results - page 34 / 111
» Direct Optimization of Ranking Measures
Sort
View
111
Voted
CEC
2011
IEEE
13 years 10 months ago
Accelerating convergence towards the optimal pareto front
—Evolutionary algorithms have been very popular optimization methods for a wide variety of applications. However, in spite of their advantages, their computational cost is still ...
Mohsen Davarynejad, Jafar Rezaei, Jos L. M. Vranck...
76
Voted
ECCV
2010
Springer
15 years 3 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
110
Voted
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICC
2008
IEEE
119views Communications» more  ICC 2008»
15 years 4 months ago
HSUPA Scheduling Algorithms Utilizing RoT Measurements and Interference Cancellations
—This paper discusses several important aspects in the HSUPA scheduling algorithms. First, it clearly demonstrates the benefit of explicitly utilizing the directly measured Rise-...
Danlu Zhang, Sharad Sambhwani, Bibhu Mohanty
WSC
2007
15 years 18 days ago
Ant-based approach for determining the change of measure in importance sampling
Importance Sampling is a potentially powerful variance reduction technique to speed up simulations where the objective depends on the occurrence of rare events. However, it is cru...
Poul E. Heegaard, Werner Sandmann