Pages that link to "Item:Q3637166"

The following pages link to Cardinality Networks and Their Applications (Q3637166):

Displaying 8 items.

• Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
• Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
• Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
• meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
• Sorting networks: to the end and back again (Q2424684) (← links)
• A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
• Faster merging networks with a small constant period (Q2629229) (← links)
• Learning Optimal Decision Sets and Lists with SAT (Q5026234) (← links)