14548 search results - page 71 / 2910 » The Optimal Path-Matching Problem |
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
CP
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
AIPS
1994
13 years 11 months ago
1994
Aimsof traditional planners had beenlimited to finding a sequenceof operators rather than finding an optimal or neax-optimalfinal state. Consequent]y, the performanceimprovementsy...