finding orthogonal arrays using satisfiability checkers and symmetry     breaking constraints

	finding orthogonal arrays using satisfiability checkers and symmetry breaking constraints
	Ma Feifei; Zhang Jian
	2008
会议名称	10th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2008)
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	247-259
会议日期	DEC 15-19,
会议地点	Hanoi, VIETNAM
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	PRICAI 2008: TRENDS IN ARTIFICIAL INTELLIGENCE
ISSN	0302-9743
ISBN	978-3-540-89196-3
部门归属	Ma, Feifei; Zhang, Jian Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China.
摘要	Orthogonal arrays are very important combinatorial objects which call be used in software testing and other areas. Mathematical methods for constructing such arrays have been studied extensively in the past decades. In contrast, computer searc
关键词	Artificial Intelligence Bionics Computer Software Selection And Evaluation Set Theory Software Testing
主办者	Vietnamese Acad Sci & Technol, Minist Sci & Technol Vietnam, Hanoi Univ Technol, Vietnam Natl UnivAir Force Off Sci Res, Asian Off Aerosp Res & Dev
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10668
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Ma Feifei,Zhang Jian. finding orthogonal arrays using satisfiability checkers and symmetry breaking constraints[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:PRICAI 2008: TRENDS IN ARTIFICIAL INTELLIGENCE,2008:247-259.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
finding orthogonal a（237KB）			开放获取	--	请求全文