253 search results - page 18 / 51 » Algorithms for the Approximate Common Divisor Problem |
250
click to vote
NLP
2000
15 years 7 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...
136
click to vote
SIBGRAPI
2005
IEEE
15 years 9 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
132
click to vote
CGVR
2006
15 years 5 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
147
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
118
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...