3875 search results - page 242 / 775 » Approximation algorithms for the 0-extension problem |
288
click to vote
NLP
2000
15 years 9 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
176
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
155
click to vote
IJSNET
2008
15 years 6 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
165
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
119
click to vote
ECCC
2010
15 years 6 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...