107 search results - page 5 / 22 » Random sampling and approximation of MAX-CSP problems |
NLP
2000
13 years 11 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...
CVIU
2007
13 years 7 months ago
2007
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
ESA
2008
Springer
13 years 9 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
TON
2002
13 years 7 months ago
2002
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...