Strong partial clones and the complexity of constraint satisfaction problems : limitations and applications /
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Elektrovnnalaš E-girji |
| Giella: | eaŋgalasgiella |
| Almmustuhtton: |
Linkoping, Sweden :
Department of Computer and Information Science, Division for Software and Systems,
2016.
|
| Ráidu: | Linkoping studies in science and technology. Dissertations ;
Number 1733. |
| Fáttát: | |
| Liŋkkat: | Click to View |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
Geahča maid: Strong partial clones and the complexity of constraint satisfaction problems :
- Strong partial clones and the complexity of constraint satisfaction problems : limitations and applications /
- Ant colony optimization and constraint programming
- Ant colony optimization and constraint programming
- Constraint satisfaction problems CSP formalisms and techniques /
- Constraint satisfaction problems CSP formalisms and techniques /
- A class of algorithms for distributed constraint optimization