16088 search results - page 427 / 3218 » A Mean-Variance Optimization algorithm |
174
click to vote
ICALP
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
197
click to vote
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper describes the analytical derivation of a new watermarking algorithm satisfying optimality properties when the distortion of the watermarked signal is caused by a Gaussi...
189
click to vote
CGO
2003
IEEE
15 years 11 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
195
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
179
click to vote
ORL
1998
15 years 7 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...