Fractal dimension estimation of atomistic surfaces using box-counting algorithms.
Automated code generation techniques for distributed memory parallelism in solving finite-difference stencils at scale significantly reduce execution time and developer effort.
Tensor Networks optimization through symbolic expressions for efficient contraction paths.
Genetic algorithm enriched with the wisdom of crowds optimizes matrix domination efficiently.
Introducing a novel DLQMC estimator for nested integration problems to improve efficiency and reduce computational costs.
Efficient parallel computing algorithm for low-autocorrelation binary sequences problem.
AMTC reduces model evaluation costs by optimizing computational graph structures.
NonlinearSolve.jl offers high-performance solvers for nonlinear equations in Julia, showcasing robustness and efficiency.
Efficiently solving nonlinear equations with high performance and robustness using NonlinearSolve.jl in Julia.
PECR is a formal system exploring computability logic through programs on real-world computers.