103
Voted
CSC
15 years 1 months ago
2008 
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
92
Voted
CSC
15 years 1 months ago
2008 
Abstract - In this paper, we present a rankrevealing two-sided orthogonal decomposition method for solving the STLS problem. An error analysis of the algorithm is given. Our numeri...
92
Voted
CSC
15 years 1 months ago
2008
- This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aidin...
CSC
15 years 1 months ago
2008 
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
104
click to vote
CSC
15 years 1 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
|
Applied Computing