757 search results - page 53 / 152 » On the hardness of approximating Max-Satisfy |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
SI3D
2006
ACM
15 years 3 months ago
2006
ACM
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
111
click to vote
FSTTCS
2003
Springer
15 years 3 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...