Name
Abstract | ||
|---|---|---|
The SAT encodings defined so far for the all-interval-series (ais) problem are very hard for local search but rather easy for systematic algorithms. We define different SAT encodings for the ais problem and provide experimental evidence that this problem can be efficiently solved with local search methods if one chooses a suitable SAT encoding. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-36079-4_12 | CCIA |
Keywords | Field | DocType |
all-interval-series problem,systematic algorithm,redundant sat encodings,local search method,experimental evidence,suitable sat encoding,ais problem,different sat encodings,local search | Constraint satisfaction,Search algorithm,Computer science,Boolean satisfiability problem,Algorithm,Propositional calculus,Redundancy (engineering),Local search (optimization),Interval vector,Encoding (memory) | Conference |
Volume | ISSN | ISBN |
2504 | 0302-9743 | 3-540-00011-9 |
Citations | PageRank | References |
4 | 0.49 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teresa Alsinet | 1 | 340 | 27.72 |
| Ramón Béjar | 2 | 305 | 36.72 |
| Alba Cabiscol | 3 | 31 | 3.86 |
| Cèsar Fernández | 4 | 157 | 19.19 |
| Felip Manyà | 5 | 787 | 59.52 |