Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
The paper describes the development and performance of parallel algorithms for the discrete element method (DEM) software. Spatial domain decomposition strategy and message passing...
Algirdas Maknickas, Arnas Kaceniauskas, Rimantas K...
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....