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 the paper, the problem of efficient task allocation in torus mesh network is considered. The authors tested the implemented metaheuristic algorithm which is based on Differential Evaluation method. The focus is taken on tuning the algorithm, i.e., choosing the best parameters of mutation scheme. The research was made using the new designed and implemented experimentation system. Ten mutation schemes...
In this paper, the problem of finding the route between two distinguished points in an area with obstacles is considered. The problem consists in minimizing the introduced cost function which is taken into account the necessity of crossing some intermediate points. The created and implemented algorithm to solving this problem is based on ant colony optimization. This algorithm is compared with the...
3d Printers create an object by printing thousands of successive thin layers. Each layer is created by the printing tool which moves on the selected paths. The ability to reduce the total length of printing paths results in lower overall time needed for printing process. In this paper there are presented two hybrid algorithms for that purpose, Greedy Two Opt and Greedy Annealing. Both of them based...
The paper concerns the problem of the allocation of processes in mesh structured systems. The implemented optimization algorithm is based on the idea of Differential Evolution. The algorithm can be tuned along with ten different mutation schemes. The essential aim of the paper is checking these mutation schemes' impact on the efficiency of the considered algorithm. The studies are based on the simulations...
The productive allocation is one of the most important factors for the development of Chip Multi-Processor (CMP) systems. The efficiency of CMP depends on the design of Processor Allocator which is driven by allocation schemes. A good allocation algorithm should identify available processors with minimum fragmentation and in as short period of time as possible. The goal of this paper is to present...
The objective of this paper is to try and determine the usability of the k-Nearest Neighbour classifier as a base classifier for an ensemble. To do this, five different ensembles are tested on a group of ten varied datasets. The most popular ensembles are taken into consideration, including Bagging, AdaBoost and Random Subspaces, as well as recently introduced algorithm called Feating. Moreover, a...
This paper focuses on applying three meta-heuristic local search algorithms to solve the problem of allocating two-dimensional tasks within a two-dimensional processor mesh in a period of time. The objective is to maximize the level of mesh utilization. To achieve this goal we adapt three algorithms: Tabu Search, Simulated Annealing and Random Search, as well as we design an auxiliary algorithm Dumb...
The paper concerns the task allocation problem for dynamic mesh structured systems. Three allocation algorithms have been evaluated, including well-known Full Search (FS), and Window-Stack Based Algorithm (WSBA) as well as Random Node Check (RNC) designed by the authors. The objective of the paper was a comparison of algorithms efficiencies on the basis of the results of simulations made using multi...
In this paper, a new algorithm, called CABI, is proposed for solving unbalanced transportation problem. The algorithm is based on the natural behavior of bees. The efficiency of the algorithm was evaluated and compared to another implemented algorithm based on well-known Tabu Search approach. The investigations have been made using an advanced computer simulation system designed and implemented by...
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.