Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Soh, Takehide"'
The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency
Externí odkaz:
http://arxiv.org/abs/2408.07510
Autor:
Sugimori, Irumi, Inoue, Katsumi, Nabeshima, Hidetomo, Schaub, Torsten, Soh, Takehide, Tamura, Naoyuki, Banbara, Mutsunori
We propose Large Neighborhood Prioritized Search (LNPS) for solving combinatorial optimization problems in Answer Set Programming (ASP). LNPS is a metaheuristic that starts with an initial solution and then iteratively tries to find better solutions
Externí odkaz:
http://arxiv.org/abs/2405.11305
This paper collects all descriptions of solvers and ISR instances submitted to CoRe Challenge 2023.
Comment: arXiv admin note: text overlap with arXiv:2208.02495, arXiv:2207.13959
Comment: arXiv admin note: text overlap with arXiv:2208.02495, arXiv:2207.13959
Externí odkaz:
http://arxiv.org/abs/2310.17136
This paper collects all descriptions of solvers and ISR instances submitted to CoRe Challenge 2022.
Externí odkaz:
http://arxiv.org/abs/2208.02495
Autor:
Ito, Takehiro, Kawahara, Jun, Nakahata, Yu, Soh, Takehide, Suzuki, Akira, Teruyama, Junichi, Toda, Takahisa
This paper proposes an algorithmic framework for various reconfiguration problems using zero-suppressed binary decision diagrams (ZDDs), a data structure for families of sets. In general, a reconfiguration problem checks if there is a step-by-step tr
Externí odkaz:
http://arxiv.org/abs/2207.13959
Autor:
Toda, Takahisa, Soh, Takehide
Publikováno v:
ACM Journal of Experimental Algorithmics, Vol. 21, No. 1, Article 1.12, 2016
All solutions SAT (AllSAT for short) is a variant of propositional satisfiability problem. Despite its significance, AllSAT has been relatively unexplored compared to other variants. We thus survey and discuss major techniques of AllSAT solvers. We f
Externí odkaz:
http://arxiv.org/abs/1510.00523
Autor:
Banbara, Mutsunori, Gebser, Martin, Inoue, Katsumi, Schaub, Torsten, Soh, Takehide, Tamura, Naoyuki, Weise, Matthias
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This allows us to
Externí odkaz:
http://arxiv.org/abs/1312.6113
Publikováno v:
Proceedings of the 16th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2023)-14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023)
14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023)
14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023), Feb 2023, Lisbon, Portugal
14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023)
14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023), Feb 2023, Lisbon, Portugal
International audience; In this paper, we propose a SAT-based method for finding attractors of bounded size in asynchronous automata networks. The automata network is a multi-valued mathematical model which has been studied for the quali- tative mode
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d25e5ad6c0e191eeacd4c01958ded961
https://doi.org/10.5220/0011675100003414
https://doi.org/10.5220/0011675100003414
Publikováno v:
情報処理学会論文誌. 59(9):1749-1760
本論文では，トークン数が整数値である一般のペトリネットを対象とし，そのデッドロック検出についてSAT 技術を用いた手法を提案する．提案手法では，非負整数値であるトークン数を
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3f0573855505ff034024dff13595d619
https://hdl.handle.net/20.500.14094/90006798
https://hdl.handle.net/20.500.14094/90006798
Publikováno v:
コンピュータ ソフトウェア. 35(3):65-78
本論文では，擬似ブール (Pseudo-Boolean; PB)制約の集合を命題論理式の充足可能性判定 (SAT)問題へ符号化する新しい手法として，ブール基数 (Boolean Cardinality; BC)制約を経由する方法を提案す
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3053cf5271a637342b458cfe6877d094
https://hdl.handle.net/20.500.14094/90006799
https://hdl.handle.net/20.500.14094/90006799