Sciweavers

3708 search results - page 68 / 742
» The Inverse Classification Problem
Sort
View
CCCG
2008
15 years 3 months ago
Application of computational geometry to network p-center location problems
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Qiaosheng Shi, Binay K. Bhattacharya
NA
2006
70views more  NA 2006»
15 years 1 months ago
A truncated projected SVD method for linear discrete ill-posed problems
Truncated singular value decomposition is a popular solution method for linear discrete ill-posed problems. However, since the singular value decomposition of the matrix is indepen...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
WG
2004
Springer
15 years 7 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano
110
Voted
FLAIRS
2006
15 years 3 months ago
Genetic Programming: Analysis of Optimal Mutation Rates in a Problem with Varying Difficulty
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
Alan Piszcz, Terence Soule
AMC
2005
150views more  AMC 2005»
15 years 1 months ago
High order fitted operator numerical method for self-adjoint singular perturbation problems
We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hith...
Kailash C. Patidar