3341 search results - page 449 / 669 » On Bounded Queries and Approximation |
168
click to vote
SPAA
2004
ACM
16 years 13 hour ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
166
click to vote
COR
2008
15 years 6 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
183
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
136
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
275
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...