The n-day menu-planning problem is formalized and decomposed it into several subproblems at the daily-menu and meal-planning level. An evolutionary algorithm is developed that quickly finds a diverse set of feasible, without examining all the possibilities. As the problem is constrained, infeasible solutions need to be repaired. At the meal-planning level, repairing is coupled with linear programming to balance infeasible meals. Empirical results, which showed that the evolutionary method might outperform a human are presented.
COBISS.SI-ID: 22525223
A tool for verification of correctness of the generated 2D Delaunay triangulation has been developed as educational support for computational geometry course. The tool allows students to discover possible flaws in implemented triangulations such as unused points, missing edges, non-Delaunay triangles or degenerated triangles. The associated benchmark data sets provide common check points of implemented solutions. The tool and the benchmark data set also serve teachers for fair evaluation of students’ work.
COBISS.SI-ID: 13012758
In the area of digital test we developed a new approach for application-oriented test of processor cores suitable for SoC implemented in FPGA. The whole instruction set is combined into a compact test sequence, which can then be repeated with different input test patterns. This considerably improves the fault coverage with no additional memory requirements. In order to evaluate the proposed solution we developed an automated fault emulation environment using the features of partial FPGA reconfiguration.
COBISS.SI-ID: 22551847
To control robots by vision is a contemporary challenge in many industrial applications. The capabilities of a robot vision system are highly significant for planning any robotic task and must, therefore, be precisely established. In this paper we describe the procedure to estimate a static and a dynamic accuracy of a robot stereo vision system consisted of the two identical 1 Megapixel cameras. The accuracy was evaluated in 2D and 3D environment. We describe the methodology, the test setup, and the results of the evaluation.
COBISS.SI-ID: 23306791
This paper presents a solution to the global optimization of continuous functions by the Differential Ant-Stigmergy Algorithm (DASA). It is applied to the high-dimensional real-parameter optimization with low number of function evaluations. The performance of the DASA is evaluated on the set of 25 benchmark functions provided by CEC'2005 Special Session on Real Parameter Optimization. Furthermore, non-parametric statistical comparisons with eleven state-of-the-art algorithms demonstrate the effectiveness and efficiency of the DASA.
COBISS.SI-ID: 22568743