Sciweavers

16088 search results - page 413 / 3218
» A Mean-Variance Optimization algorithm
Sort
View
TCS
2008
15 years 7 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
195
Voted
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
15 years 7 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
LCTRTS
2009
Springer
16 years 2 months ago
Live-range unsplitting for faster optimal coalescing
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Sandrine Blazy, Benoît Robillard
199
Voted
ICML
2005
IEEE
16 years 8 months ago
Expectation maximization algorithms for conditional likelihoods
We introduce an expectation maximizationtype (EM) algorithm for maximum likelihood optimization of conditional densities. It is applicable to hidden variable models where the dist...
Jarkko Salojärvi, Kai Puolamäki, Samuel ...
WWW
2008
ACM
16 years 8 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy