The following pages link to Nei Yoshihiro Soma (Q228558):
Displayed 16 items.
- A computational DNA solution approach for the quadratic Diophantine equation (Q275220) (← links)
- (Q852948) (redirect page) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Observations on optimal parallelizations of two-list algorithm (Q991072) (← links)
- A polynomial-time DNA computing solution for the bin-packing problem (Q1039671) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- Comments on parallel algorithms for the knapsack problem. (Q1853236) (← links)
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499) (← links)
- On irreversibility of von Neumann additive cellular automata on grids (Q2489910) (← links)
- A greedy search for the three-dimensional bin packing problem: the packing static stability case (Q3044093) (← links)
- Extração de regras de classificação a partir de redes neurais para auxílio à tomada de decisão na concessão de crédito bancário (Q3621492) (← links)
- An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem (Q5189094) (← links)
- An exact algorithm for the subset sum problem (Q5955091) (← links)
- Rectangle packing with a recursive pilot method (Q6065652) (← links)