Sciweavers

CSC
2009
14 years 16 days ago
Fast Monte Carlo Algorithms on Re-Wired Small-World Spin Models
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
Kenneth A. Hawick
CSC
2009
14 years 16 days ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
CSC
2009
14 years 16 days ago
Improving Random Walk Performance
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
Ilya Safro, Paul D. Hovland, Jaewook Shin, Michell...
CSC
2009
14 years 16 days ago
Nonsingularity Study of SAI Preconditioners for M-matrices
In this paper, we study the theoretical properties of sparse approximate inverse (SAI) preconditioners. Particularly, we show that for Mmatrices, nonnegativeness is the key to com...
Kai Wang, Rui Wang
CSC
2009
14 years 16 days ago
Simulating Flows Over Wavy Inclined Surfaces
Jean Paul Pascal, Serge D'Alessio
CSC
2009
14 years 16 days ago
A New Iterative Method for Solving Initial Value Problems
- In this paper, we introduce a new parameter iteration method (P-Iteration for short) which can be applied on Adams-Moulton methods to solve initial value problems. Compared with ...
Mingshen Wu, Weihu Hong