Functions and Algorithms
A REVIEW OF BENCHMARKING FUNCTIONS FOR GENETIC ALGORITHMS
... BENCHMARKING FUNCTIONS In this section various GA models and the suggested parameter sets are briefly presented by researchers in order to establish the most frequently used functions are ...The ...
New voting functions for neural network algorithms
... Network algorithms are among the best performing machine learning ...the algorithms may vary between multiple runs because of the stochastic nature of these ...machine algorithms which can be used as ...
14
Scalarizing Functions in Decomposition-based Multiobjective Evolutionary Algorithms
... Scalarizing Functions in Decomposition-based Multiobjective Evolutionary Algorithms Shouyong Jiang, Shengxiang Yang, Senior Member, IEEE, Yong Wang, Member, IEEE, and Xiaobin Liu ...
19
Local search algorithms based on benchmark test functions problem
... search algorithms were indeed implemented in the ...SA algorithms, using an ensemble of expansively employed unimodal and multimodal standard benchmark ...benchmark functions that have been ...
6
Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
... ACO algorithms is a challenging task where the first results have been obtained only ...two algorithms behave extremely different on simple functions in case the evaporation factor is ...unimodal ...
21
Fitting Clearing Functions to Empirical Data: Simulation Optimization and Heuristic Algorithms.
... BIOGRAPHY Necip Baris Kacar, was born in 1983 in Istanbul, Turkey. He graduated from American Robert High School in 1999 and received his Bachelor of Science degree in Mechanical Engineering from Bogazici University, ...
176
Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
... We would like to also remark that the result obtained here and its proof idea is similar to Theorem 1 of [11], where the expected first hitting time of a simple algorithm for noisy bi-objective optimization problems is ...
19
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
... knapsack constraint. Oper. Res. Lett. 32(1), 41–43 (2004) 37. Wolsey, L.: Maximising real-valued submodular functions: primal and dual heuris- tics for location problems. Math. Oper. Res. 7, 410–425 (1982) 38. ...
14
Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations
... of algorithms for TU-values like the Shapley value are one of the biggest obstacles in the practical application of otherwise axiomatically convincing solu- tion concepts of cooperative game ...Polynomial-time ...
32
Procedures, Functions and Standard Algorithms
... • reference parameters are used where data must be passed OUT of a procedure; the main program variable can be changed; • user-defined functions are an efficient and readable way of codi[r] ...
38
Belief Functions: Theory and Algorithms
... also involves constructing a subset of each focal set, showing the additional set- based dimension of uncertainty associated with belief functions. For a Bayesian filter, the prediction step generally results in ...
165
Optimising hashing functions with genetic algorithms
... The number of collisions can also be controlled by controlling the utilisation of the hashtable. When the table reaches some threshold ratio of unused locations to total table size, th[r] ...
30
The role of mutation in the optimisation of numeric functions by genetic algorithms
... In general the best results are obtained with a coarse granularity; we believe that a fine granularity retards convergence by allowing only small changes in the variabl[r] ...
17
Scalarizing Functions in Decomposition-Based Multiobjective Evolutionary Algorithms
... 2) Scalarizing Functions: SFs play a fundamental role in MOEA/D and its variants. They can significantly affect the search ability of the evolving popula- tion and the quality of the res[r] ...
18
Modelling Distance Functions Induced by Face Recognition Algorithms
... the algorithms on various aspects, like its ability to handle large databases, variation in illumination, scale, pose and changes in ...of algorithms to locate, normalize and identify faces from a ...the ...
71
Bent functions at the minimal distance and algorithms of constructing linear codes for CDMA
... This is the standard for the 3rd Generation cellular communications systems. In this standard bent functions are used for constructing codes of constant amplitude. This application allows to decrease PAPR ...
6
Robust Three-step Broyden-like Algorithms for Functions of Several Variables
... practice, algorithms for solving (1) are iterative in nature as solutions to such equations are rather not in existence or difficult to find using analytical ...
6
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
... The problem of maximizing a monotone submodular function under a knapsack constraint is classical and well-studied. First introduced by Wolsey [20], the problem is known to be NP- hard but can be approximated within the ...
14
Hashing. hash functions collision resolution applications. References: Algorithms in Java, Chapter 14.
... Collision resolution: Algorithm and data structure to handle two keys that hash to the same index.. Equality test: Method for checking whether two keys are equal.[r] ...
50
ADT –Algorithms: Complexity, Time – Space trade off - Mathematical notations and functions - Asymptotic notations –
... Rule 1: for loops - the size of the loop times the running time of the body. Find the running time of statements when executed only once Find how many times each statement is exec[r] ...
34