|
|
|
|
|
Gujji Murali Mohan Reddy, Alan B. Seitenfuss, Débora de Oliveira Medeiros, Luca Meacci, Milton Assunção and Michael Vynnycky
Although two-dimensional (2D) parabolic integro-differential equations (PIDEs) arise in many physical contexts, there is no generally available software that is able to solve them numerically. To remedy this situation, in this article, we provide a compa...
ver más
|
|
|
|
|
|
|
|
|
Shyr-Long Jeng, Rohit Roy and Wei-Hua Chieng
Mason?s gain formula can grow factorially because of growth in the enumeration of paths in a directed graph. Each of the (n - 2)! permutation of the intermediate vertices includes a path between input and output nodes. This paper presents a novel method ...
ver más
|
|
|
|
|
|
|
|
|
Basilio Lenzo and Valerio Rossi
Lap time minimisation methods have great relevance in the analysis of race tracks, and in the design and optimisation of race vehicles. Several lap time minimisation approaches have been proposed in the literature, which are computationally demanding bec...
ver más
|
|
|
|
|
|
|
|
|
Md. Sabir Hossain, Ahsan Sadee Tanim, Sadman Sakib Choudhury, S. M. Afif Ibne Hayat, Muhammad Nomani Kabir, Mohammad Mainul Islam
The traveling salesman problem (TSP) is a famous NP-hard problem in the area of combinatorial optimization. It is utilized to locate the shortest possible route that visits every city precisely once and comes back to the beginning point from a given set ...
ver más
|
|
|
|
|
|
|
|
|
Sangkyun Lee and Jeonghyun Lee
Deep neural networks (DNNs) have been quite successful in solving many complex learning problems. However, DNNs tend to have a large number of learning parameters, leading to a large memory and computation requirement. In this paper, we propose a model c...
ver más
|
|
|
|