SAT solver by CE & BK algorithms
SAT solvers by Cross-Entropy (CE) and a Botev-Kroeze (BK) optimization algorithms
CNF SAT problems can be formulated as :
S(X)=sum(j=1,...,m)C_j, where C_j=max(0 , (2X_i-1)*Aji
Please run the demo files
test_ce_satA.m
test_cemcmc_satA.m
In order to compile mex-files on your platform, please run first
mexme_cebk_sat.m (be sure that mex -setup is done before)
Zitieren als
Sebastien PARIS (2026). SAT solver by CE & BK algorithms (https://de.mathworks.com/matlabcentral/fileexchange/21259-sat-solver-by-ce-bk-algorithms), MATLAB Central File Exchange. Abgerufen.
Kompatibilität der MATLAB-Version
Plattform-Kompatibilität
Windows macOS LinuxKategorien
- Code Generation > Fixed-Point Designer > Data Type Exploration > Algorithm Acceleration > Functions Supported for Code Acceleration >
- FPGA, ASIC, and SoC Development > Fixed-Point Designer > Data Type Exploration > Algorithm Acceleration > Functions Supported for Code Acceleration >
Tags
Live Editor erkunden
Erstellen Sie Skripte mit Code, Ausgabe und formatiertem Text in einem einzigen ausführbaren Dokument.
| Version | Veröffentlicht | Versionshinweise | |
|---|---|---|---|
| 1.3.0.0 | Fixed for modern Matlab & 64bits OS versions |
||
| 1.2.0.0 | -Compatible with Linux64 & GCC
|
||
| 1.1.0.0 | - Must compile with non-C99 compiler |
||
| 1.0.0.0 | -Improve CE parse inputs |
