Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Noriyuki FUJIMOTO"'
Publikováno v:
Journal of Architecture and Planning (Transactions of AIJ). 87:1130-1140
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e9516726419d98f5189c23709fc1b99
https://doi.org/10.3130/aija.87.1130
https://doi.org/10.3130/aija.87.1130
Publikováno v:
ICPP
In this paper, we propose integer sorting algorithms based on histogram and prefix-sums and we show that their GPU-implementations are faster than the fastest sorting GPU-implementations in Thrust and/or CUB library for several input data. In particu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0368246e215efa2c15a897a1a29adf0a
https://doi.org/10.1145/3472456.3472486
https://doi.org/10.1145/3472456.3472486
Autor:
Kouki Nanai, Noriyuki Fujimoto
Publikováno v:
GECCO Companion
The Quadratic Unconstrained Binary Optimization problem (QUBO) is an NP-hard optimization problem. QUBO can be reduced from many other combinatorial optimization problems. Hence, if we can solve QUBO, we can also solve many other problems. The paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ea002625b1bf5832ae875e9b4d18b3b
https://doi.org/10.1145/3449726.3463208
https://doi.org/10.1145/3449726.3463208
Publikováno v:
Journal of the City Planning Institute of Japan. 53:603-609
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6372f15506e7cf1795f86b7d34169c10
https://doi.org/10.11361/journalcpij.53.603
https://doi.org/10.11361/journalcpij.53.603
Autor:
Md. Maruf Hussain, Noriyuki Fujimoto
Publikováno v:
Parallel Computing. 92:102589
During the last couple of years, parallel MOPSO (Multi-objective Particle Swarm Optimization) with two or more objectives has gained a lot of attention in the literature on GPU computing. A number of implementations have been published for MOPSO on a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::208dfa937db1c74de1f36eafca043a01
https://doi.org/10.1016/j.parco.2019.102589
https://doi.org/10.1016/j.parco.2019.102589
Publikováno v:
SCIS&ISIS
We understand a long-term time series by transitions of trends and features. We must partition time series into several terms of intervals of different trends and features. In statistics, change detection expresses it as a degree of change using prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67ef7c2291b1ac0995e2a3d9e97ce016
https://doi.org/10.1109/scis-isis.2018.00139
https://doi.org/10.1109/scis-isis.2018.00139
Autor:
Md. Maruf Hussain, Noriyuki Fujimoto
Publikováno v:
2018 International Conference on Computational Science and Computational Intelligence (CSCI).
A key component of particle swarm optimization algorithms is pseudorandom number generators (PRNGs) which provide random numbers to drive the stochastic search process. In this paper, we implemented ten PRNGs on CPUs and graphics processing units (GP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33cb93f9972181623954a20a90baa4ae
https://doi.org/10.1109/csci46756.2018.00064
https://doi.org/10.1109/csci46756.2018.00064
Autor:
Hiroyuki Kobayashi, Noriyuki Fujimoto
Publikováno v:
TENCON
It is not realistic to connect all of cores in a multicore-processor each other because current multicore-processors have many cores. Therefore there are many studies about network topologies to connect cores. The order/degree problem is one of the t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37d0a89a8b0417c6964168f86232fdf8
https://doi.org/10.1109/tencon.2018.8650461
https://doi.org/10.1109/tencon.2018.8650461
Autor:
Md. Maruf Hussain, Noriyuki Fujimoto
Publikováno v:
CEC
In last couple of years, parallel two or many objective MOPSO (Multi-objective Particle Swarm Optimization) have been proposed in literature. Denumerable implementations were published, however they had not achieved faster execution time and good Par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4436da92a73fa31ad80ef1dcbfbd6153
https://doi.org/10.1109/cec.2018.8477848
https://doi.org/10.1109/cec.2018.8477848
Publikováno v:
IFSA-SCIS
Car Racing Game is a competition of computer programs in IEEE CEC 2007, where two car agents compete with each other for taking way points in a two-dimensional plane. The agent can get information on itself, the other agent, and the current and next
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::269057f56ead5303685b5f0788f88bcf
https://doi.org/10.1109/ifsa-scis.2017.8023267
https://doi.org/10.1109/ifsa-scis.2017.8023267