約束滿足問題 (Chinese Wikipedia)
Analysis of information sources in references of the Wikipedia article "約束滿足問題" in Chinese language version.
refsWebsite
Global rank
Chinese rank
1st place
1st place
6th place
4th place
18th place
57th place
aaai.org
- Solution reuse in dynamic constraint satisfaction problems （页面存档备份，存于互联网档案馆）, Thomas Schiex
archive.org
- Stuart Jonathan Russell; Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall. 2010: Chapter 6. ISBN 9780136042594.
arxiv.org
- Bodirsky, Manuel; Pinsker, Michael. Schaefer's theorem for graphs. CoRR. 2010,. abs/1011.2894: 2894. Bibcode:2010arXiv1011.2894B. arXiv:1011.2894
. - Cai, Jin-Yi; Chen, Xi. Complexity of Counting CSP with Complex Weights. CoRR. 2011,. abs/1111.2384 [2012-04-08]. （原始内容存档于2017-01-17）.
harvard.edu
ui.adsabs.harvard.edu
- Bodirsky, Manuel; Pinsker, Michael. Schaefer's theorem for graphs. CoRR. 2010,. abs/1011.2894: 2894. Bibcode:2010arXiv1011.2894B. arXiv:1011.2894 .
psu.edu
citeseerx.ist.psu.edu
- Ian Miguel. Dynamic Flexible Constraint Satisfaction and its Application to AI Planning (2001). University of Edinburgh School of Informatics. [2014-05-04]. hdl:1842/326 doi:10.1.1.9.6733. （原始内容存档于2016-03-04） （英语）.
uci.edu
ics.uci.edu
- Dechter, R. and Dechter, A., Belief Maintenance in Dynamic Constraint Networks In Proc. of AAAI-88, 37-42. (PDF). [2012-04-08]. （原始内容 (PDF)存档于2012-11-17）.
web.archive.org
- Cai, Jin-Yi; Chen, Xi. Complexity of Counting CSP with Complex Weights. CoRR. 2011,. abs/1111.2384 [2012-04-08]. （原始内容存档于2017-01-17）.
- Ian Miguel. Dynamic Flexible Constraint Satisfaction and its Application to AI Planning (2001). University of Edinburgh School of Informatics. [2014-05-04]. hdl:1842/326 doi:10.1.1.9.6733. （原始内容存档于2016-03-04） （英语）.
- Dechter, R. and Dechter, A., Belief Maintenance in Dynamic Constraint Networks In Proc. of AAAI-88, 37-42. (PDF). [2012-04-08]. （原始内容 (PDF)存档于2012-11-17）.
- Solution reuse in dynamic constraint satisfaction problems （页面存档备份，存于互联网档案馆）, Thomas Schiex