Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Shaowei Cai"'
Autor:
Jianfeng Wu, Kang Yang, Shaowei Cai, Xiaohan Zhang, Lichen Hu, Fanjia Lin, Su-qin Wu, Changchun Xiao, Wen-Hsien Liu, Jiahuai Han
Publikováno v:
Nature Communications, Vol 13, Iss 1, Pp 1-20 (2022)
Plasma cells are terminally differentiated B cells that are specialized for antibody secretion. Authors show here that genomic deletion of the p38α mitogen activated protein kinase specifically in the B cell lineage leads to diminished plasma cell d
Externí odkaz:
https://doaj.org/article/7eacb188fa0445489b0d57415f695ccf
Publikováno v:
Information Sciences. 621:287-307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a13e3684460f379860c99607b701a056
https://doi.org/10.1016/j.ins.2022.11.107
https://doi.org/10.1016/j.ins.2022.11.107
Publikováno v:
Journal of Artificial Intelligence Research. 74:1515-1563
On practical applications, state-of-the-art SAT solvers dominantly use the conflict-driven clause learning (CDCL) paradigm. An alternative for satisfiable instances is local search solvers, which is more successful on random and hard combinatorial in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca0eeae77277fc6bca3c67f45a7f08e6
https://doi.org/10.1613/jair.1.13666
https://doi.org/10.1613/jair.1.13666
Publikováno v:
Journal of Artificial Intelligence Research. 74:1485-1513
The Clique Partitioning Problem (CPP) is essential in graph theory with a number of important applications. Due to its NP-hardness, efficient algorithms for solving this problem are very crucial for practical purposes, and simulated annealing is prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b6807fd96927c0d27ad6e8aaabdedd0
https://doi.org/10.1613/jair.1.13382
https://doi.org/10.1613/jair.1.13382
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:10146-10155
The maximum k-club problem (MkCP) is an important clique relaxation problem with wide applications. Previous MkCP algorithms only work on small-scale instances and are not applicable for large-scale instances. For solving instances with different sca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::693c69766bdaf6f3fa39ff53dab18916
https://doi.org/10.1609/aaai.v36i9.21254
https://doi.org/10.1609/aaai.v36i9.21254
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:10283-10290
Configuration checking (CC) has been confirmed to alleviate the cycling problem in local search for combinatorial optimization problems (COPs). When using CC heuristics in local search for graph problems, a critical concept is the configuration of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26f3be58aa1063bcb67c3b2d2a2f2c28
https://doi.org/10.1609/aaai.v36i9.21269
https://doi.org/10.1609/aaai.v36i9.21269
Publikováno v:
ACM Transactions on Computational Logic; Oct2023, Vol. 24 Issue 4, p1-26, 26p
Publikováno v:
IEEE Transactions on Cybernetics. :1-14
The set covering problem (SCP) is a fundamental NP-hard problem in computer science and has a broad range of important real-world applications. In practice, SCP instances transformed from real-world applications would be of large scale, so it is of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7da8dade13a1db69532f853385abdda
https://doi.org/10.1109/tcyb.2022.3199147
https://doi.org/10.1109/tcyb.2022.3199147
Publikováno v:
Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e20fa3c95e00071541363b32dcc0a5d3
https://doi.org/10.1145/3540250.3549155
https://doi.org/10.1145/3540250.3549155
Autor:
Shaowei Cai, Kaile Su
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 26:434-440
An interesting strategy called configuration checking (CC) was recently proposed to handle the cycling problem in local search for Minimum Vertex Cover. A natural question is whether this CC strategy also works for SAT. The direct application of CC d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca66d5b79cd901712fe86f9996892699
https://doi.org/10.1609/aaai.v26i1.8133
https://doi.org/10.1609/aaai.v26i1.8133