1647 search results - page 47 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
109
Voted
DISOPT
2010
15 years 2 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
129
click to vote
EUROCOLT
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
135
click to vote
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
115
Voted
ICTCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
111
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...