检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Luyu JIANG Dantong OUYANG Qi ZHANG Liming ZHANG
机构地区:[1]College of Computer Science and Technology,Jilin University,Changchun 130012,China [2]Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education),Jilin University,Changchun 130012,China
出 处:《Frontiers of Computer Science》2024年第2期239-241,共3页中国计算机科学前沿(英文版)
基 金:supported by the National Natural Science Foundation of China (Grant Nos.62076108,and 61872159);the education department of Jilin Province (JJKH20211106KJ,JKH20211103KJ).
摘 要:1 Introduction Local search method is a rising star for solving combinatorial optimization problems in recent years,and the state-of-the-art local search-based incomplete Maximum Satisfiability(MaxSAT)solversshowpromisingperformance even competitive to many complete solvers in recent MaxSAT Evaluations.
关 键 词:MAX OPTIMIZATION local
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49