Optimizing local search-based partial MaxSAT solving via initial assignment prediction

This publication has 31 references indexed in Scilit:

• Towards efficient allocation of graph convolutional networks on hybrid computation-in-memory architecture
  Science China Information Sciences, 2021
• Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search
  2019
• Text Simplification with Self-Attention-Based Pointer-Generator Networks
  2018
• Modeling Relational Data with Graph Convolutional Networks
  2018
• Modeling and solving staff scheduling with partial weighted maxSAT
  Annals of Operations Research, 2017
• A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity
  Science China Information Sciences, 2017
• Intra-individual comparison of different gadolinium-based contrast agents in the quantitative evaluation of C6 glioma with dynamic contrast-enhanced magnetic resonance imaging.
  Science China Life Sciences, 2017
• More efficient two-mode stochastic local search for random 3-satisfiability
  Applied Intelligence, 2014
• An upper (lower) bound for Max (Min) CSP
  Science China Information Sciences, 2014
• Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability
  2013