Sciweavers

77 search results - page 11 / 16
» Optimum Follow the Leader Algorithm
Sort
View
OPODIS
2004
13 years 8 months ago
Fast Localized Delaunay Triangulation
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
Filipe Araújo, Luís Rodrigues
JMLR
2006
117views more  JMLR 2006»
13 years 7 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 9 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
14 years 2 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
14 years 24 days ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...