Search
for Author
All Reviews
Popescu, Marius
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
1
of
1
reviews
Can machine learning learn a decision oracle for NP problems? A test on SAT
Grozea C., Popescu M. Fundamenta Informaticae 131(3-4): 441-450, 2014. Type: Article
Finding good heuristics for a nondeterministic polynomial-time (NP) problem is a very important research goal that is mostly addressed on a case-by-case basis. This paper takes a different path: a classic NP problem, 3-SAT, is used as ...
...
Jul 30 2014
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy