388 search results - page 15 / 78 » Improving Exact Algorithms for MAX-2-SAT |
ESOP
2000
Springer
14 years 13 days ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
AI
2007
Springer
14 years 3 months ago
2007
Springer
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
ANNS
2007
13 years 10 months ago
2007
The ability to store and retrieve information is critical in any type of neural network. In neural network, the memory particularly associative memory, can be defined as the one i...
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....