438 search results - page 5 / 88 » A (1-1 e)-approximation algorithm for the generalized assign... |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
TC
1998
13 years 7 months ago
1998
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
FOCS
1999
IEEE
14 years 1 days ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
SIAMCOMP
2010
13 years 2 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...