Hybrid Maximum Clique Algorithm Using Parallel Integer Programming for Uniform Test Assembly
Author:
Affiliation:
1. University of Electro-Communications, Tokyo, Japan
2. Sundai Institute of AI for Education, SATT Company Ltd., Tokyo, Japan
Funder
Promotion of Science Grants-in-Aid for Scientific Research
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Subject
Computer Science Applications,General Engineering,Education
Link
http://xplorestaging.ieee.org/ielx7/4620076/9802796/09745471.pdf?arnumber=9745471
Reference47 articles.
1. Efficient maximum clique computation and enumeration over large sparse graphs
2. A new exact maximum clique algorithm for large and massive sparse graphs
3. A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
4. A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms
Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Automated Parallel Test Forms Assembly using Zero-suppressed Binary Decision Diagrams;IEEE Access;2023
2. The Development of an Automatic Test Assembly System for a Formative Assessment in Mastery Learning Instruction: Case of the SQL Mastery Course;IEEE Access;2023
3. Item Difficulty Constrained Uniform Adaptive Testing;Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners, Doctoral Consortium and Blue Sky;2023
4. Automated Test Assmbly using Zero-suppressed Binary Decision Diagrams;Transactions of the Japanese Society for Artificial Intelligence;2022-09-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3