572 search results - page 79 / 115 » Exponential-Time Approximation of Hard Problems |
135
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
169
Voted
WINE
2010
Springer
15 years 12 days ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
130
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
94
Voted
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models--Hidden Markov Random Fields (H...
118
Voted
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...