期刊文献+

人工智能问题中的相变现象研究 被引量:2

Research of Phase Transition in Artificial Intelligence
下载PDF
导出
摘要 在人工智能研究领域的很多问题中存在着相变现象(phase transition)。问题中的某个参数发生较小的变化便会引起问题的某个属性发生突变。相变现象与问题求解结构有很大关系,将从相变现象的发展、相关概念以及相变现象与问题求解的关系等方面对相变现象做全面的论述,提出了有待解决的开放性问题,并对相变现象的研究给以总结和展望。 Phase transition exists in many problems of Artificial Intelligence.Phase transition is with a little change to the parameter there is a sharp transition to the system.There is a great relationship between phase transition and the structure of problem,this paper made more comprehensive introduction about the developing,related concepts of phase transition and the relationship between phase transition and the structure of problem.Moreover,summarized some unresolved questions and given the summary and outlook of research on phase transition.
出处 《计算机科学》 CSCD 北大核心 2011年第5期1-7,共7页 Computer Science
基金 国家自然科学基金(60473042 60573067 60803102 61070084)资助
关键词 相变 SAT问题 参数问题 backbone集合 Phase transition Propositional satisfiability problem Parameter problem Backbone set
  • 相关文献

参考文献2

二级参考文献84

  • 1Robertson N, Seymour P D. Graph Minors -- A Survey. In Surveys in Combinatorics 1985, Anderson I (ed.), Cambridge Univ. Press, Cambridge, 1985, pp.153-171.
  • 2Robertson N, Seymour P D. Graph minors VIII. A Kuratowski theorem for general surfaces. J. Combin. Theory Ser. B, 1990,48: 255-288.
  • 3Robertson N, Seymour P D. Graph minors XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 1995, 63: 65-110.
  • 4Fellows M, Langston M. Nonconstructive tools for proving polynomial-time decidability. J. ACM, 1988, 35: 727-739.
  • 5DIMACS Workshop on Faster Exact Solutions for NP-Hard Problems. Princeton, Feb. 23-24, 2000.
  • 6Papadimitriou C H, Yannakakis M. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 1991, 43: 425--440.
  • 7Impagliazzo R, Paturi R. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 2001, 63: 512-530.
  • 8Chen J, Chor B, Fellows M, Huang X, Juedes D, Kanj I, Xia G.Tight lower bounds for certain parameterized NP-hard problems. In Proc. 19th Annual IEEE Conference on Computational Complexity ( CCC 2004), 2004, pp.150-160.
  • 9Anthony M, Biggs N. Computational Learning Theory. Cambridge University Press, Cambridge, UK, 1992.
  • 10Papadimitriou C H, Yannakakis M. On limited nondeterminism and the complexity of VC dimension. Journal of Computer and System Sciences, 1996, 53: 161-170.

共引文献23

同被引文献7

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部