Sciweavers

1364 search results - page 30 / 273
» Collective Optimization
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
14 years 4 months ago
Evolutionary optimization of multistage interconnection networks performance
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
Jirí Jaros
ISMIR
2004
Springer
111views Music» more  ISMIR 2004»
14 years 3 months ago
Optimizing Measures Of Melodic Similarity For The Exploration Of A Large Folk Song Database
This investigation aims at finding an optimal way of measuring the similarity of melodies. The applicability for an automated analysis and classification was tested on a folk song...
Daniel Müllensiefen, Klaus Frieler
CGO
2004
IEEE
14 years 1 months ago
Targeted Path Profiling: Lower Overhead Path Profiling for Staged Dynamic Optimization Systems
In this paper, we present a technique for reducing the overhead of collecting path profiles in the context of a dynamic optimizer. The key idea to our approach, called Targeted Pa...
Rahul Joshi, Michael D. Bond, Craig B. Zilles
SBBD
2004
82views Database» more  SBBD 2004»
13 years 11 months ago
Optimizing Ranking Calculation in Web Search Engines: a Case Study
Web search engines compete to offer the fastest responses with highest relevance. However, as Web collections grow, it becomes more difficult to achieve this purpose. As most user...
Miguel Costa, Mário J. Silva