Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Feature

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • معلومة اضافية
    • Contributors:
      The Pennsylvania State University CiteSeerX Archives
    • Collection:
      CiteSeerX
    • نبذة مختصرة :
      Learning to predict variable polarity Most solvers treat each instance of a computational problem as independent. Different instances, however, are often related. When solving a new instance, can we reach a solution more quickly by leveraging knowledge gained from past instances? This work [2] explores the possibility of transferring successful low-level solver decisions from solved to unsolved instances, using fine-grained problem structure to identify areas of similarity. Outline of the learning procedure Given a set of related satisfiable problem instances, some previously solved, 1. compute low-level structural features for every variable in solved instances, 2. label each feature vector with the observed satisfying values of its variable, 3. train an efficient binary classifier on these feature vectors, and 4. use the classifier to intelligently initialize your solver for each new instance.
    • File Description:
      application/pdf
    • Relation:
      http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.7981; http://www.cs.utexas.edu/%7Ebsilvert/files/silverthorn.sat2011.poster.pdf
    • الدخول الالكتروني :
      http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.7981
      http://www.cs.utexas.edu/%7Ebsilvert/files/silverthorn.sat2011.poster.pdf
    • Rights:
      Metadata may be used without restrictions as long as the oai identifier remains attached to it.
    • الرقم المعرف:
      edsbas.F1514CAE