7006 search results - page 564 / 1402 » Approximation Algorithms |
169
click to vote
QEST
2006
IEEE
16 years 27 days ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
162
click to vote
TWC
2010
15 years 1 months ago
2010
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...
209
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
197
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
160
click to vote
IPL
2008
15 years 6 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...