There are several parallel programming models available for numerical computations at diļ¬erent levels of expressibility and ease of use. For the development of new domain speciļ¬...
Nowadays, capturing the knowledge in ontological structures is one of the primary focuses of the semantic web research. To exploit the knowledge from the vast quantity of existing ...
Michal Laclavik, Marek Ciglan, Martin Seleng, Ladi...
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...
We present a parallel algorithm for solving the 4D Vlasov equation. Our algorithm is designed for distributed memory architectures. It uses an adaptive numerical method which reduc...
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...