Sciweavers

8824 search results - page 332 / 1765
» On the Complexity of Real Functions
Sort
View
FCT
2003
Springer
15 years 12 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 10 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
167
Voted
HYBRID
2000
Springer
15 years 10 months ago
Towards Procedures for Systematically Deriving Hybrid Models of Complex Systems
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
Pieter J. Mosterman, Gautam Biswas
WSC
2007
15 years 9 months ago
A supply chain paradigm to model business pprocesses at the Y-12 National Security Complex
The NNSA’s Y-12 National Security Complex is a manufacturing facility operated by BWXT Y-12. Y-12’s missions include ensuring the US’ nuclear weapons deterrent, storing nucl...
Reid L. Kress, Jack Dixon, Thomas M. Insalaco, Ric...
WSCG
2004
185views more  WSCG 2004»
15 years 8 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang