77 search results - page 10 / 16 » Markov Approximation for Combinatorial Network Optimization |
108
click to vote
UAI
1997
14 years 11 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
114
click to vote
DATAMINE
2010
14 years 9 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
TSP
2008
14 years 9 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
115
click to vote
NCA
2008
IEEE
14 years 9 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...