Sciweavers

6315 search results - page 299 / 1263
» Approximating Solution Structure
Sort
View
NA
2006
70views more  NA 2006»
15 years 6 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
EOR
2002
125views more  EOR 2002»
15 years 6 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
JC
2002
50views more  JC 2002»
15 years 6 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian
TCS
2011
15 years 1 months ago
Sorting and selection on dynamic data
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
177
Voted
SIAMMA
2010
122views more  SIAMMA 2010»
15 years 1 months ago
Asymptotic Flocking Dynamics for the Kinetic Cucker-Smale Model
In this paper, we analyse the asymptotic behavior of solutions of the continuous kinetic version of flocking by Cucker and Smale [16], which describes the collective behavior of an...
J. A. Carrillo, M. Fornasier, J. Rosado, G. Toscan...