Decision tree is an effective supervised learning method for solving classification and regression problems. This article combines the Pearson correlation coefficient with the CART decision tree, ...

Abstract: Genetic algorithm (GA) is a common approach for multi-objective path planning. However, conventional GA performs poorly on large-scale complex maps due to the lack of an efficient ...

Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

The Locally Competitive Algorithm (LCA) is a biologically plausible computational architecture for sparse coding, where a signal is represented as a linear combination of elements from an ...

Geographic maps are a popular means to visualize spatial statistics. Conventionally, each map region is displayed with an area proportional to the actual land area. But equal-area maps can grossly ...

Abstract: NAND flash memory has many advantages, including a small form factor, non-volatility, and high reliability. However, problems caused by physical limitations, such as asymmetric I/O latencies ...