Sciweavers

29908 search results - page 214 / 5982
» On the Complexity of
Sort
View
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
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...
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
INFOCOM
1995
IEEE
15 years 10 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
DEBS
2010
ACM
15 years 9 months ago
Complex event processing synergies with predictive analytics
For Complex Event Processing (CEP), the synergy with Predictive Analytics (PA) is a promising research direction. In this paper we focus on the inclusion of PA technologies into C...
Gabriella Toth, Lajos Jeno Fülöp, L&aacu...