"A Study of SAT-Based Branching Heuristics for the CSP."

Yannis Argyropoulos, Kostas Stergiou (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-87881-0_5

access: closed

type: Conference or Workshop Paper

metadata version: 2019-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/setn/ArgyropoulosS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/setn/ArgyropoulosS08
Yannis Argyropoulos, Kostas Stergiou:
A Study of SAT-Based Branching Heuristics for the CSP. SETN 2008: 38-50

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.