313 search results - page 2 / 63 » Complete Local Search with Memory |
IJCAI
2003
13 years 6 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
CG
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
AUSAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
HPCA
2009
IEEE
14 years 5 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...