Bandwidth is one of the canonical NP-complete problems [17]. It is NP-hard to approximate within any constant, even on trees [22]. Gupta gave a randomized approximation algorithm [8] for bandwidth on trees, which has an approximation ratio of O(log n). This algorithm has the best currently known approximation ratio on trees. Gupta showed that his algorithm has an approximation ratio of O(log n)...

Nonlinear function approximation is one of the most important tasks in system analysis and identification. Several models have been presented to achieve an accurate approximation on nonlinear mathematics functions. However, the majority of the models are specific to certain problems and systems. In this paper, an evolutionary-based wavelet neural network model is proposed for structure definiti...

Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...