633 search results - page 17 / 127 » Locality and Hard SAT-Instances |
IWINAC
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
TAINN
2005
Springer
14 years 27 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
AUSAI
2004
Springer
14 years 25 days 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...
DAGSTUHL
2004
13 years 8 months ago
2004
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
ACL
2011
12 years 11 months ago
2011
Disambiguating concepts and entities in a context sensitive way is a fundamental problem in natural language processing. The comprehensiveness of Wikipedia has made the online enc...