Sciweavers

8540 search results - page 145 / 1708
» The Dynamic Servers Problem
Sort
View
110
Voted
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 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
WEBDB
2004
Springer
79views Database» more  WEBDB 2004»
15 years 3 months ago
Scalable Dissemination: What's Hot and What's Not
A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses m...
Jonathan Beaver, Nicholas Morsillo, Kirk Pruhs, Pa...
WG
2004
Springer
15 years 3 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano
SIGIR
2009
ACM
15 years 4 months ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra
TRANSCI
2010
101views more  TRANSCI 2010»
14 years 8 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu