3680 search results - page 474 / 736 » cases 2010 |
168
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
209
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
206
click to vote
ISSTA
2010
ACM
15 years 9 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
217
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
173
click to vote
PAM
2010
Springer
15 years 9 months ago
2010
Springer
We currently observe a rising interest in mobile broadband, which users expect to perform in a similar way as its fixed counterpart. On the other hand, the capacity allocation proc...