| Combinatorial Search in CP-Based Iterated Belief Propagation
|
2020 |
Babaki, Behrouz |
| Dashed Strings and the Replace(-all) Constraint
|
2020 |
Amadini, Roberto |
| Replication-Guided Enumeration of Minimal Unsatisfiable Subsets
|
2020 |
Bendík, Jaroslav |
| Watched Propagation of 0-1 Integer Linear Constraints
|
2020 |
Devriendt, Jo |
| DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
|
2020 |
Dudek, Jeffrey M. |
| Treewidth-Aware Quantifier Elimination and Expansion for QCSP
|
2020 |
Fichte, Johannes K. |
| Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
|
2020 |
Gocht, Stephan |
| Parallelization of TSP Solving in CP
|
2020 |
Isoart, Nicolas |
| Finding the Hardest Formulas for Resolution
|
2020 |
Peitl, Tomáš |
| Solving the Group Cumulative Scheduling Problem with CPO and ACO
|
2020 |
Groleaz, Lucas |
| In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem
|
2020 |
Zhou, Neng-Fa |
| Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing
|
2020 |
Antuori, Valentin |
| Exact Approaches to the Multi-agent Collective Construction Problem
|
2020 |
Lam, Edward |
| The Confidence Constraint: A Step Towards Stochastic CP Solvers
|
2020 |
Mercier-Aubin, Alexandre |
| Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks
|
2020 |
Liu, Minghao |
| Omissions in Constraint Acquisition
|
2020 |
Tsouros, Dimosthenis C. |
| Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
|
2020 |
Say, Buser |
| Effective Encodings of Constraint Programming Models to SMT
|
2020 |
Davidson, Ewan |
| Towards Faster Reasoners by Using Transparent Huge Pages
|
2020 |
Fichte, Johannes K. |
| The Argmax Constraint
|
2020 |
Gange, Graeme |
Tag hinzufügen