The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we describe a new source code transformation called dynamic loop reversal that can increase temporal and spatial locality. We also describe a formal method for predicting the cache behaviour and evaluation results of the accuracy of the model by measurements on a cache monitor. The comparisons of the numbers of measured cache misses and the numbers of cache misses estimated by the model...
In this article some novel scheduling heuristics for Multi-Skill Resource-Constrained Project Scheduling Problem have been proposed and compared to state-of-the-art priority rules, based on task duration, resource salaries and precedence relations. New heuristics stand an aggregation of known methods, but are enhanced by skills domain. The goal of the paper is to investigate, whether evaluated methods...
In this article two approaches of Tabu Search in Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP) have been proposed, based on different neighbourhood generation methods. The first approach assumes swapping resources assigned to pair of tasks, while the second one proposes assigning any resource that could perform given task. Both approaches need to respect the skill constraints...
We discuss some enhancements of approximate SQL extensions available in Infobright's database technology. We explain how these new enhancements can speed up execution of complex correlated sub-queries, which are quite popular in advanced database applications. We compare our research to the state-of-the-art solutions in the area of analytic databases. We also show in what sense our technology follows...
This paper presents a concept of a software platform and a method of hybrid composition of web services and hybrid grounding of abstract composition plans. The paper also describes the architecture of the implemented platform and its modules.
In this paper, an investigation of the influence of the population size on the genetic algorithm (GA) performance for a model parameter identification problem, is considered. The mathematical model of an E. coli fed-batch cultivation process is studied. The three model parameters - maximum specific growth rate (μmax), saturation constant (kS) and yield coefficient (YS/X) are estimated using different...
In this paper, we consider the maximum flow problem on networks with non-linear transfer functions. We consider special types of transfer functions, which are particularly relevant for applications. For concave transfer functions, we reduce the NL-flow problem to the generalized flow problem and solve it using a polynomial-time approximation scheme. For convex, s-shaped and monotonically growing piecewise...
In many areas of application it is important to estimate unknown model parameters in order to model precisely the underlying dynamics of a physical system. In recent years, Sequential Monte Carlo (SMC) methods have become a very popular tool for Bayesian parameter estimation. In this case, the problem of finding the best parameters configuration comes to the optimization issue which is to determine...
The Molecular Distance Geometry Problem (MDGP) is the one of finding an embedding of a molecular graph in the three dimensional space, where graph vertices represent atoms and edges represent known distances between some pairs of atoms. The MDGP is a constraint satisfaction problem and it is generally cast as a continuous global optimization problem. Moreover, under some assumptions, this optimization...
We present ant colony optimisation approach, enriched with a novel self-adaptation mechanism, applied to solve DIVERSUM Problem that consits of generating a small diversified entity summarisation in a knowledge graph. The recently proposed DIVERSUM problem is viewed in this paper in a novel way as a NP-hard combinatorial optimisation problem. The presented preliminary experimental results indicate...
We present a novel method for automatic parallelization of functional programs which combines interpretation and just-in-time compilation. We propose an execution model for a Lisp-based programming language which involves a runtime environment which is able to identify portions of code worth running in parallel and is able to spawn new threads of execution. Furthermore, in order to achieve better...
This paper discusses factors influencing accuracy of estimating localization of radio networks terminals in indoor environment. It introduces parameters that can be useful to describe the quality of localization of radio landmarks. The paper presents a software for computer aided reference radio stations placement inside the buildings and shows the results of exemplary simulations carried out with...
In the article a new approach for control of a pressure-constrained batch reactor and a new multi-step optimization algorithm were presented. The considered batch reactor was described by both differential and algebraic equations. State constraints incorporate always difficulties into a mathematical model of the reactor, so a new algorithm based on a multiple shooting SQP-line search method was proposed...
The paper presents a concept and the outline of the implementation of a hybrid approach to modeling and solving constrained problems. Two environments of mathematical programming (MP) and logic programming (LP) were integrated. The strengths of integer programming (IP) and constraint logic programming (CLP), in which constraints are treated in a different way and different methods are implemented,...
Distribution network design deals with defining which elements will be part of the supply chain and how they will be interrelated. Many authors have studied this problem from a cost minimization point of view. Nowadays the sustainability factor is increasing its importance in the logistics operations and must be considered in the design process. We deal here with the problem of determining the location...
The paper presents the concept and an outline of the implementation of a hybrid approach to supply chain modeling and optimization. Two environments mathematical programming (MP) and logic programming (LP) were integrated. The strengths of integer programming (IP) and constraint logic programming (CLP), in which constraints are treated in a different way and different methods are implemented, were...
The rising costs and demand of electricity for high-performance computing systems pose difficult challenges to system administrators that are trying to simultaneously reduce operating costs and offer state-of-the-art performance. However, system performance and energy consumption are often conflicting objectives. Algorithms are necessary to help system administrators gain insight into this energy/performance...
A biased random key genetic algorithm (BRKGA) is an efficient method for solving combinatorial optimization problems. It can be applied to solve both single-objective and multi-objective optimization problems. The BRKGA operates on a chromosome encoded as a key vector of real values between [0, 1]. Generally, the chromosome has to be decoded by using a single decoding method in order to obtain a feasible...
Evolutionary optimization algorithms and their hybrid forms have become popular for solving multimodal complex problems which are very difficult to solve by traditional methods in the recent years. In the literature, many hybrid algorithms are proposed in order to achieve a better performance than the well-known evolutionary optimization methods being used alone by combining their features for balancing...
The Dial-a-Ride Problem (DARP) models an operation research problem related to the on demand transport. This paper introduces one of the fundamental features of this type of transport: the robustness. This paper solves the Dial-a-Ride Problem by integrating a measure of insertion capacity called Insertability. The technique used is a greedy insertion algorithm based on time constraint propagation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.