6315 search results - page 13 / 1263 » Approximating Solution Structure |
AAAI
1997
14 years 11 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
92
Voted
ENTCS
2006
14 years 9 months ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
FFA
2008
14 years 9 months ago
2008
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
IJKESDP
2010
14 years 8 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
SIAMSC
2008
14 years 9 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...