2126 search results - page 129 / 426 » An optimization algorithm for imprecise multi-objective prob... |
156
click to vote
BIOADIT
2004
Springer
15 years 11 months ago
2004
Springer
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...
153
click to vote
AAAI
2006
15 years 7 months ago
2006
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
118
click to vote
VISUALIZATION
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper presents a novel approach to assist the user in exploring appropriate transfer functions for the visualization of volumetric datasets. The search for a transfer functio...
134
click to vote
SIAMJO
2010
15 years 4 months ago
2010
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
163
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...