4860 search results - page 392 / 972 » SNPs Problems, Complexity, and Algorithms |
128
Voted
JAIR
2008
15 years 3 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
112
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
154
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
133
Voted
TWC
2008
15 years 3 months ago
2008
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
115
Voted
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a very efficient numerical algorithm for minimizing certain curvature dependent functionals that appear in a variety of well known variational models of image processin...