Sciweavers

3433 search results - page 46 / 687
» Heuristics for a bidding problem
Sort
View
AIPS
2008
13 years 10 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
CORR
2006
Springer
148views Education» more  CORR 2006»
13 years 7 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
FOCS
2006
IEEE
14 years 1 months ago
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
We investigate variants of Lloyd’s heuristic for clustering high dimensional data in an attempt to explain its popular
Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulma...
HEURISTICS
2007
139views more  HEURISTICS 2007»
13 years 7 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 1 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener