default search action
Takashi Yazane
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Xiaotian Li
, Koji Nakano
Bit duplication technique to generate hard quadratic unconstrained binary optimization problems with adjustable sizes. Concurr. Comput. Pract. Exp. 36(10) (2024) - 2023
- [j4]Tomohiro Imanaga, Koji Nakano
Simple iterative trial search for the maximum independent set problem optimized for the GPUs. Concurr. Comput. Pract. Exp. 35(14) (2023) - [j3]Hiroshi Kagawa, Yasuaki Ito
High-throughput FPGA implementation for quadratic unconstrained binary optimization. Concurr. Comput. Pract. Exp. 35(14) (2023) - [c11]Shunsuke Tsukiyama, Koji Nakano, Yasuaki Ito, Takashi Yazane, Junko Yano, Takumi Kato, Shiro Ozaki, Rie Mori, Ryota Katsuki:
Solving the N-Queens Puzzle by a QUBO Model with Quadratic Size. candar 2023: 59-67 - [c10]Koji Nakano
Diverse Adaptive Bulk Search: a Framework for Solving QUBO Problems on Multiple GPUs. IPDPS Workshops 2023: 314-325 - [i2]Koji Nakano
Dual-Matrix Domain-Wall: A Novel Technique for Generating Permutations by QUBO and Ising Models with Quadratic Sizes. CoRR abs/2308.01024 (2023) - 2022
- [j2]Ryota Yasudo
GPU-accelerated scalable solver with bit permutated cyclic-min algorithm for quadratic unconstrained binary optimization. J. Parallel Distributed Comput. 167: 109-122 (2022) - [c9]Koji Nakano
A benchmark QUBO problem inspired by digital halftoning based on the human visual system. CANDAR 2022: 56-65 - [c8]Xiaotian Li
Bit duplication technique to generate hard QUBO problems. CANDARW 2022: 180-184 - [c7]Ryota Yasudo, Koji Nakano
Graph-theoretic Formulation of QUBO for Scalable Local Search on GPUs. IPDPS Workshops 2022: 425-434 - [i1]Koji Nakano
Diverse Adaptive Bulk Search: a Framework for Solving QUBO Problems on Multiple GPUs. CoRR abs/2207.03069 (2022) - 2021
- [c6]Tomohiro Imanaga, Koji Nakano
Solving the sparse QUBO on multiple GPUs for Simulating a Quantum Annealer. CANDAR 2021: 19-28 - 2020
- [c5]Tomohiro Imanaga, Koji Nakano
Efficient GPU Implementation for Solving the Maximum Independent Set Problem. CANDAR 2020: 29-38 - [c4]Hiroshi Kagawa, Yasuaki Ito, Koji Nakano
Fully-Pipelined Architecture for Simulated Annealing-based QUBO Solver on the FPGA. CANDAR 2020: 39-48 - [c3]Ryota Yasudo
Adaptive Bulk Search: Solving Quadratic Unconstrained Binary Optimization Problems on Multiple GPUs. ICPP 2020: 62:1-62:11 - [c2]Masaki Tao, Koji Nakano
A Work-Time Optimal Parallel Exhaustive Search Algorithm for the QUBO and the Ising model, with GPU implementation. IPDPS Workshops 2020: 557-566
2010 – 2019
- 2013
- [j1]Takashi Yazane, Hiroyuki Masuyama, Shoji Kasahara
Effect of network-coding overhead on end-to-end throughput for multihop wireless networks. Perform. Evaluation 70(1): 14-27 (2013) - 2010
- [c1]Takashi Yazane, Hiroyuki Masuyama, Shoji Kasahara
End-to-End Throughput Analysis of Multihop Wireless Networks with Network Coding. ICC 2010: 1-5
Coauthor Index
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-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: