For memory constrained environments, optimization for program size is often as important as, if not more important than, optimization for execution speed. Commonly, compilers try to reduce the code segment but neglect the stack segment, although the stack can significantly grow during the execution of recursive functions because a separate activation record is required for each recursive call. ...

In this paper, we introduce a benchmark suite on RTP/RTCP processing. The suite consists of three benchmarks, namely RTP Sender, RTP Receiver and RTCP Processing. For each benchmark, three aspects are specified: functions, measurements and environments. After implementing the benchmarks, we perform profiling in order to determine the time-critical functions and investigate the architectural cha...

This paper presents an exact method which finds the minimum factored form of an incompletely specified Boolean function. The problem is formulated as a Quantified Boolean Formula (QBF) and is solved by general-purpose QBF solver. We also propose a novel graph structure, called an X-B (eXchanger Binary) tree, which compactly and implicitly enumerates binary trees. Leveraged by this graph structu...

This paper presents an object-oriented software system that implements a cuckoo search (CS) metaheuristic for unconstrained optimization problems. Yang and Deb developed cuckoo search algorithm in MATLAB and tested it on some standard benchmark functions as well as on some engineering optimization problems where it showed promising results. We developed our algorithm in JAVA programming languag...

Function optimization is the most important context for studying genetic algorithm (GA) operators. In this paper a new GA operator is introduced which greatly improves several well-known benchmark functions used in function optimization. The new operator cuts a circular chromosome at any locus selected randomly. By this operation, various types of linear chromosomes can be formed from a parent ...

Various techniques of fitness landscape analysis for the determination of optimisation problem hardness for evolutionary algorithms are proposed in the literature. However, a few implementations of these techniques and their application in practice are described nowadays. In the paper comparative statistical and information analysis for benchmark fitness functions such as Sphere, Rastrigin, Ros...

Firefly algorithm is an optimization algorithm which mimics the behavior of fireflies to solve problems. In this paper, firefly algorithm with mutation is researched and the performance effect of parameter settings is studied in order to show which setting is more suitable for solving optimization problems. It is tested on ten standard function problems and compared with original firefly algori...

This paper focuses on the fixed polarity ReedMuller (FPRM) expression of multiple-valued logic (MVL) symmetric functions. In the FPRM expression, each variable occurs in exactly one complemented form. We show properties of the FPRM of partially symmetric functions and report experimental results for certain benchmark functions.

Within an agency theoretic framework adapted to the portfolio delegation issue, we show how to construct optimal benchmarks. In accordance with U.S. regulations, the benchmark-adjusted compensation scheme is taken to be symmetric. The investor’s only control is to force the manager to adopt the appropriate benchmark. Solving simultaneously the manager’s and the investor’s dynamic optimization p...