![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Miyuki Koshimura
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Xiaojuan Liao
, Hui Zhang
, Miyuki Koshimura
, Rong Huang
, Fagen Li
:
Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS. J. Univers. Comput. Sci. 29(8): 911-937 (2023) - 2022
- [j10]Miyuki Koshimura
, Emi Watanabe, Yuko Sakurai, Makoto Yokoo
:
Concise integer linear programming formulation for clique partitioning problems. Constraints An Int. J. 27(1-2): 99-115 (2022) - [c38]Tomoya Sugahara, Kaito Yamashita, Nathanaël Barrot
, Miyuki Koshimura
, Makoto Yokoo
:
Robust Weighted Partial Maximum Satisfiability Problem: Challenge to σ2P-Complete Problem. PRICAI (1) 2022: 17-31 - 2020
- [c37]Miyuki Koshimura
, Ken Satoh:
A Simple yet Efficient MCSes Enumeration with SAT Oracles. ACIIDS (1) 2020: 191-201 - [c36]Aolong Zha
, Rongxuan Gao, Qiong Chang
, Miyuki Koshimura, Itsuki Noda:
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem. ICTAI 2020: 285-292
2010 – 2019
- 2019
- [j9]Xiaojuan Liao
, Miyuki Koshimura, Kazuki Nomoto, Suguru Ueda, Yuko Sakurai, Makoto Yokoo
:
Improved WPM encoding for coalition structure generation under MC-nets. Constraints An Int. J. 24(1): 25-55 (2019) - [j8]Aolong Zha
, Miyuki Koshimura, Hiroshi Fujita:
N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT. Constraints An Int. J. 24(2): 133-161 (2019) - [j7]Xiaojuan Liao, Miyuki Koshimura:
A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets. J. Log. Comput. 29(6): 913-931 (2019) - [c35]Xiaojuan Liao, Hui Zhang, Miyuki Koshimura, Rong Huang, Wenxin Yu:
Maximum Satisfiability Formulation for Optimal Scheduling in Overloaded Real-Time Systems. PRICAI (1) 2019: 618-631 - [c34]Emi Watanabe, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo
:
Solving Coalition Structure Generation Problems over Weighted Graph. PRIMA 2019: 338-353 - 2017
- [c33]Aolong Zha
, Naoki Uemura, Miyuki Koshimura, Hiroshi Fujita:
Mixed Radix Weight Totalizer Encoding for Pseudo-Boolean Constraints. ICTAI 2017: 868-875 - [c32]Aolong Zha
, Kazuki Nomoto, Suguru Ueda, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo
:
Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation. PRIMA 2017: 143-159 - [c31]Aolong Zha
, Miyuki Koshimura, Hiroshi Fujita:
A Hybrid Encoding of Pseudo-Boolean Constraints into CNF. TAAI 2017: 9-12 - 2016
- [j6]Xiaojuan Liao, Hui Zhang, Miyuki Koshimura:
Reconstructing AES Key Schedule Images with SAT and MaxSAT. IEICE Trans. Inf. Syst. 99-D(1): 141-150 (2016) - 2014
- [j5]Xiaojuan Liao, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
MaxSAT Encoding for MC-Net-Based Coalition Structure Generation Problem with Externalities. IEICE Trans. Inf. Syst. 97-D(7): 1781-1789 (2014) - [j4]Xiaojuan Liao, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Extending MaxSAT to Solve the Coalition Structure Generation Problem with Externalities Based on Agent Relations. IEICE Trans. Inf. Syst. 97-D(7): 1812-1821 (2014) - 2013
- [c30]Toru Ogawa, Yangyang Liu, Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita:
Modulo Based CNF Encoding of Cardinality Constraints and Its Application to MaxSAT Solvers. ICTAI 2013: 9-17 - [c29]Xiaojuan Liao, Hui Zhang, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Using MaxSAT to Correct Errors in AES Key Schedule Images. ICTAI 2013: 284-291 - [c28]Hiroshi Fujita, Miyuki Koshimura, Ryuzo Hasegawa:
SCSat: A Soft Constraint Guided SAT Solver. SAT 2013: 415-421 - 2012
- [j3]Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, Ryuzo Hasegawa:
QMaxSAT: A Partial Max-SAT Solver. J. Satisf. Boolean Model. Comput. 8(1/2): 95-100 (2012) - [c27]Xue-Feng Zhang, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Hybrid particle swarm optimization and convergence analysis for scheduling problems. GECCO (Companion) 2012: 307-314 - [c26]Yuichi Takiguchi, Koji Kurakado, Tetsuya Oishi, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Evaluating Reranking Methods based on Link Co-occurrence and Category in Wikipedia. ICAART (1) 2012: 277-282 - [c25]Xiaojuan Liao, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Solving the Coalition Structure Generation Problem with MaxSAT. ICTAI 2012: 910-915 - 2011
- [c24]Xue-Feng Zhang, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
An efficient hybrid particle swarm optimization for the Job Shop Scheduling Problem. FUZZ-IEEE 2011: 622-626 - [c23]Xue-Feng Zhang, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Combining PSO and local search to solve scheduling problems. GECCO (Companion) 2011: 347-354 - [c22]Koji Kurakado, Tetsuya Oishi, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
Evaluating Reranking Methods using Wikipedia Features. ICAART (1) 2011: 376-381 - [c21]Wataru Shirakihara, Tetsuya Oishi, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
Trendspotter Detection System for Twitter. ICAART (1) 2011: 625-628 - [i1]Xuanye An, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
QMaxSAT version 0.3 & 0.4. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 7-15 - 2010
- [j2]Xue-Feng Zhang, Bin Tong, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
A Multi-Layer Hybrid Particle Swarm Optimization Model for Flow Shop Scheduling Problem. Aust. J. Intell. Inf. Process. Syst. 12(4) (2010) - [j1]Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa:
Solving Open Job-Shop Scheduling Problems by SAT Encoding. IEICE Trans. Inf. Syst. 93-D(8): 2316-2318 (2010) - [c20]Noriaki Chikara, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Rule Extraction from Blog Using Inductive Logic Programming. Web Intelligence/IAT Workshops 2010: 269-272 - [c19]Kentaro Hori, Tetsuya Oishi, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
Related Word Extraction from Wikipedia for Web Retrieval Assistance. ICAART (2) 2010: 192-199
2000 – 2009
- 2009
- [c18]Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa:
Minimal Model Generation with Respect to an Atom Set. FTP 2009 - [c17]Tetsuya Oishi
, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
Related Word Extraction Algorithm for Query Expansion - An Evaluation. PRIMA Workshops 2009: 33-48 - 2008
- [c16]Tetsuya Oishi
, Shunsuke Kuramoto, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
A Method for Query Expansion Using the Related Word Extraction Algorithm. Web Intelligence/IAT Workshops 2008: 41-44 - [c15]Tetsuya Oishi
, Yoshiaki Kambara, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
Personalized Search Using ODP-based User Profiles Created from User Bookmark. PRICAI 2008: 839-848 - 2007
- [c14]Tetsuya Oishi, Shunsuke Kuramoto, Hiroto Nagata, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
User-Schedule-based Web Page Recommendation. Web Intelligence 2007: 776-779 - 2004
- [c13]Miyuki Koshimura, Mayumi Umeda, Ryuzo Hasegawa:
Abstract Model Generation for Preprocessing Clause Sets. LPAR 2004: 67-78 - 2002
- [c12]Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura, Yasuyuki Shirai:
A Model Generation Based Theorem Prover MGTP for First-Order Logic. Computational Logic: Logic Programming and Beyond 2002: 178-213 - 2001
- [c11]Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa:
Model Generation with Boolean Constraints. LPAR 2001: 299-308 - 2000
- [c10]Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
Efficient Minimal Model Generation Using Branching Lemmas. CADE 2000: 184-199 - [c9]Miyuki Koshimura, Ryuzo Hasegawa:
Proof Simplification for Model Generation and Its Applications. LPAR 2000: 96-113 - [c8]Miyuki Koshimura, Megumi Kita, Ryuzo Hasegawa:
Minimal Model Generation with Factorization and Constrained Search. PRICAI 2000: 793
1990 – 1999
- 1997
- [c7]Ryuzo Hasegawa, Katsumi Inoue, Yoshihiko Ohta, Miyuki Koshimura:
Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. CADE 1997: 176-190 - [c6]Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura:
MGTP: A Model Generation Theorem Prover - Its Advanced Features and Applications. TABLEAUX 1997: 1-15 - 1994
- [c5]Ryuzo Hasegawa, Miyuki Koshimura:
An AND Parallelization Method for MGTP and Its Evaluation. PASCO 1994: 194-203 - 1992
- [c4]Katsumi Inoue, Miyuki Koshimura, Ryuzo Hasegawa:
Embedding Negation as Failure into a Model Generation Theorem Prover. CADE 1992: 400-415 - [c3]Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita:
MGTP: A Parallel Theorem Prover Based on Lazy Model Generation. CADE 1992: 776-780 - [c2]Masayuki Fujita, Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita:
Model Generation Theorem Provers on a Parallel Inference Machine. FGCS 1992: 357-375 - [c1]Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita:
Lazy Model Generation For Improving The Efficiency of Forward Reasoning Theorem Provers. IWAR 1992: 221-238
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint