Login / Signup

The application of parameterized algorithms for solving SAT to the study of several discrete models of collective behavior.

Stepan KochemazovAlexander A. SemenovOleg Zaikin
Published in: MIPRO (2016)
Keyphrases
  • collective behavior
  • stochastic local search
  • discrete data
  • optimization problems
  • combinatorial optimization
  • sat instances
  • continuous domains
  • np complete problems
  • sat solving