Sciweavers

8298 search results - page 359 / 1660
» On the Complexity of Numerical Analysis
Sort
View
WSC
2001
15 years 9 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin
DBSEC
2000
117views Database» more  DBSEC 2000»
15 years 9 months ago
Database Security 2000
Database systems are being more and more used, with larger sized databases, and as components of very complex systems, that include numerous protocols. Database security problems ...
John R. Campbell
174
Voted
WSC
1997
15 years 9 months ago
Design of Experiments for Fitting Subsystem Metamodels
For complex systems, traditional methods of experiencebased design are ineffective: the design task must be supported by simulations. Conceptual design and system-level detailed d...
Russell R. Barton
ANOR
2010
130views more  ANOR 2010»
15 years 7 months ago
Metaheuristic methods based on Tabu search for assigning judges to competitions
Two metaheuristic methods based on Tabu search are introduced to assign judges to individual competitions in a tournament. The complexity of the mathematical formulation accounting...
Amina Lamghari, Jacques A. Ferland
CAGD
2006
90views more  CAGD 2006»
15 years 7 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini