Nei Yoshihiro Soma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2024

Rectangle packing with a recursive Pilot MethodVitor Pimenta dos Reis Arruda, Luiz Gustavo Bizarro Mirisola, Nei Yoshihiro Soma. cor, 161:106447, January 2024. [doi]

2023

Solving NP-Complete Akari games with deep learningAttilio Sbrana, Luiz Gustavo Bizarro Mirisola, Nei Yoshihiro Soma, Paulo André Lima de Castro. entcom, 47:100580, August 2023. [doi]

2021

Trajectory planning with a dynamic obstacle clustering strategy using Mixed-Integer Linear ProgrammingVinícius Antonio Battagello, Nei Yoshihiro Soma, Rubens Junqueira Magalhães Afonso. amcc 2021: 3339-3344 [doi]

2016

An analysis of bibliometric indicators to JCR according to Benford's lawAlexandre Donizeti Alves, Horacio Hideki Yanasse, Nei Yoshihiro Soma. scientometrics, 107(3):1489-1499, 2016. [doi]

A general resolution of intractable problems in polynomial time through DNA ComputingCarlos Alberto Alonso Sanches, Nei Yoshihiro Soma. biosystems, 150:119-131, 2016. [doi]

2015

A breadth-first search applied to the minimization of the open stacksMarco Antonio Moreira de Carvalho, Nei Yoshihiro Soma. jors, 66(6):936-946, 2015. [doi]

2014

Benford's Law and articles of scientific journals: comparison of JCR® and Scopus dataAlexandre Donizeti Alves, Horacio Hideki Yanasse, Nei Yoshihiro Soma. scientometrics, 98(1):173-184, 2014. [doi]

A computational DNA solution approach for the Quadratic Diophantine EquationCarlos Alberto Alonso Sanches, Nei Yoshihiro Soma. amc, 238:436-443, 2014. [doi]

2010

Observations on optimal parallelizations of two-list algorithmCarlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse. pc, 36(1):65-67, 2010. [doi]

2009

A polynomial-time DNA computing solution for the Bin-Packing ProblemCarlos Alberto Alonso Sanches, Nei Yoshihiro Soma. amc, 215(6):2055-2062, 2009. [doi]

2008

Parallel time and space upper-bounds for the subset-sum problemCarlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse. TCS, 407(1-3):342-348, 2008. [doi]

2007

An optimal and scalable parallelization of the two-listCarlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse. eor, 176(2):870-879, 2007. [doi]

2004

A method for solving the minimization of the maximum number of open stacks problem within a cutting processJosé Carlos Becceneri, Horacio Hideki Yanasse, Nei Yoshihiro Soma. cor, 31(14):2315-2332, 2004. [doi]

2002

Comments on parallel algorithms for the knapsack problemCarlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse. pc, 28(10):1501-1505, 2002.

An exact algorithm for the subset sum problemNei Yoshihiro Soma, Paolo Toth. eor, 136(1):57-66, 2002. [doi]

1995

A Polynomial Approximation Scheme for the Subset Sum ProblemNei Yoshihiro Soma, Alan Solon Ivor Zinober, Horacio Hideki Yanasse, Peter John Harley. DAM, 57(2-3):243-253, 1995. [doi]

1987

A new enumeration scheme for the knapsack problemHoracio Hideki Yanasse, Nei Yoshihiro Soma. DAM, 18(2):235-245, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL