Sciweavers

16188 search results - page 403 / 3238
» The Optimal PAC Algorithm
Sort
View
TCS
2008
15 years 6 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
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
15 years 6 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
PPSN
2010
Springer
15 years 4 months ago
Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
Olaf Mersmann, Mike Preuss, Heike Trautmann
LCTRTS
2009
Springer
16 years 1 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
ICML
2005
IEEE
16 years 7 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 ...