PPAM
2007
Springer
14 years 6 months ago
2007
Springer
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
Lattice-Boltzmann (LB) methods are a well-known technique in the context of computational fluid dynamics. By nature, they can easily be parallelized but their adaptation to the Gr...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
This paper presents a case study of numerical simulations in an easy-to-use matrix computation framework named Simple Interface for Library Collections (SILC), which allows users t...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. Memetic Algorithms are the most frequently used hybrid of Evolutionary Algorithms (EA) for real-world applications. This paper will deal with one of the most important ob...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
Real-time access to accurate and reliable timing information is necessary to profile scientific applications, and crucial as simulations become increasingly complex, adaptive, an...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. In our work we are developing a complete agent-based ecommerce system. Thus far we have been focusing on interactions between clients and shops (C2B relationships). In th...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
PPAM
2007
Springer
14 years 6 months ago
2007
Springer
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). ...