Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference20 articles.
1. Bertele, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press, New York, NY, USA.
2. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., & Verfaillie, G. (1999). Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints 4: 199–240.
3. Cooper, M. C. (1990). An optimal k-consistency algorithm. Artif. Intell. 41: 89–95.
4. Cooper, M. C. (1993). Interpretation of line drawings of complex objects. Image Vis. Comput. 11(2): 82–90.
5. Cooper, M. C. (1999). Linear-time algorithms for testing the realisability of line drawings of curved objects. Artif. Intell. 108: 31–67.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Virtual Pairwise Consistency in Cost Function Networks;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2023
2. Cost Function Networks to Solve Large Computational Protein Design Problems;Operations Research and Simulation in Healthcare;2020-07-25
3. Graphical Models: Queries, Complexity, Algorithms;LEIBNIZ INT PR INFOR;2020
4. Valued Constraint Satisfaction Problems;A Guided Tour of Artificial Intelligence Research;2020
5. Pareto-based Soft Arc Consistency for Multi-objective Valued CSPs;Proceedings of the 11th International Conference on Agents and Artificial Intelligence;2019