7006 search results - page 620 / 1402 » Approximation Algorithms |
204
click to vote
ICML
1998
IEEE
16 years 8 months ago
1998
IEEE
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
166
click to vote
WWW
2007
ACM
16 years 8 months ago
2007
ACM
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
165
click to vote
COCO
2005
Springer
16 years 24 days ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
174
click to vote
COLT
2004
Springer
16 years 20 days ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
197
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...