Sciweavers

6102 search results - page 658 / 1221
» Generating Optimizing Specializers
Sort
View
NIPS
2001
15 years 8 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
NETWORKING
2000
15 years 8 months ago
Sensitivity of ABR Congestion Control Algorithms to Hurst Parameter Estimates
Optimal linear predictors can be utilised in ABR control algorithms for the management of self-similar network traffic. However, estimates of the Hurst parameter are required to ge...
Sven A. M. Östring, Harsha Sirisena, Irene Hu...
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
15 years 8 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Kiran Lakhotia, Mark Harman, Phil McMinn
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
15 years 8 months ago
Estimation of pump-curves using genetic algorithms
This paper presents a variety of different ways of estimating the general parameters for pump-curves. First a formulation is made that converts the problem into estimating four p...
Gerulf K. M. Pedersen, Zhenyu Yang
GECCO
2008
Springer
165views Optimization» more  GECCO 2008»
15 years 8 months ago
Multiple sequence alignment using a GLOCSA guided genetic algorithm
This paper introduces GLOCSA as a new scoring function to rate multiple sequence alignments. It is intended to be simple, considering the whole alignment at once and reflecting t...
Edgar David Arenas-Díaz, Helga Ochoterena-B...