Department
of |
|
Susan L. EpsteinThe CUNY Graduate School, Department
of Computer Science and Hunter College, Department
of Computer Science
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Home Publications Collaborators Courses Contact
|
|
PARAMETERIZED PROBLEMS (CSP)A parameterized problem is a randomly-generated CSP whose constraint graph is connected. A parameterized problem is described here as <n, k, d, t>. -vt after the parameters indicates that the problems in the file have varying tightness, -vs means varying solvability and -u means that all problems are unsolvable (over-constrained). The results below come from experiments using ACE with variable-ordering heuristic mean domain/dynamic degree. Results using a mixture of heuristics (Advisors) will be reported soon. Results reported were averaged over ACE runs on the first 100 problems in each file. #PROBLEMS indicates how many problems are available on file VISITED NODES indicates the average number of nodes visited during search.
CONSTRAINT CHECKS indicates the average number of constrant checks.
|