113 search results - page 5 / 23 » Optimal Hardness Results for Maximizing Agreements with Mono... |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
DEDS
2010
13 years 7 months ago
2010
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
GI
2001
Springer
13 years 12 months ago
2001
Springer
Abstract: This paper introduces a new method for optimally provisioning and pricing differentiated services, that maximizes profit and maintains a small blocking probability. Reso...