Browsing by Subject "Computer algorithms"
Now showing items 1-20 of 190
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
(2015-05)
Article
Open AccessThis paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ... -
A comparison study of different algorithms for energy-aware placement of virtual machines
(Springer, 2018)
Conference report
Restricted access - publisher's policyCloud Computing services are essential to modern society. The increasing number of people and organisations using these types of services results in a higher demand in datacenters, which in turn, is raising energy consumption ... -
A comparison study on meta-heuristics for ground station scheduling problem
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
Conference report
Open AccessIn ground station scheduling problem the aim is to compute an optimal planning of communications between Spacecrafts (SCs) and operations teams of Ground Stations (GSs). While such allocation of tasks to ground stations ... -
A constraint programming-based genetic algorithm (CPGA) for capacity output optimization
(OmniaScience, 2014-12)
Article
Open AccessPurpose: The manuscript presents an investigation into a constraint programming-based genetic algorithm for capacity output optimization in a back-end semiconductor manufacturing company. Design/methodology/approach: ... -
A fuzzy inductive approach for rule-based modelling of high level structures in algorithmic composition systems
(2015)
Conference report
Restricted access - publisher's policyAlgorithmic composition systems are now widely understood. However, its capacity for producing outputs consistently showing high level structures is still a field of research. In the present work, the Fuzzy Inductive ... -
A GA-based simulation system for WMNs: comparison analysis for different number of flows, client distributions, DCF and EDCA functions
(Springer, 2017-02-04)
Article
Open AccessIn this paper, we compare the performance of Distributed Coordination Function (DCF) and Enhanced Distributed Channel Access (EDCA) for normal and uniform distributions of mesh clients considering two Wireless Mesh Network ... -
A GA-based simulation system for WMNs: performance analysis for different WMN architectures considering transmission rate and OLRS protocol
(Institute of Electrical and Electronics Engineers (IEEE), 2016)
Conference report
Open AccessIn this paper, we evaluate the performance of two WMN architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3. We compare the performance for two architectures considering ... -
A generaliser applied to SBL
(1992-03)
Research report
Open AccessIn this work two algorithms have been developed: a generaliser and a hierarchy constructor. The generaliser receives as inputs the descriptions of some positive examples of a concept and it calculates their maximal conjunctive ... -
A genetic algorithm-based system for Wireless Mesh Networks: analysis of system data considering different routing protocols and architectures
(Springer, 2016-07-01)
Article
Open AccessWireless mesh networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in ... -
A hybrid recommender system for improving automatic playlist continuation
(2021-05-01)
Article
Open AccessAlthough widely used, the majority of current music recommender systems still focus on recommendations’ accuracy, userpreferences and isolated item characteristics, without evaluating other important factors, like the joint ... -
A load balancing method for parallel genetic CFD optimizations
(2015)
Conference report
Restricted access - publisher's policyCFD optimizations are characterized by long and highly variable objective function evaluation times. The aim of this study is to improve the parallel performance using a new load balancing master-worker parallelization ... -
A method for assessing parameter impact on control-flow discovery algorithms
(CEUR-WS.org, 2015)
Conference report
Open AccessGiven an event log L, a control-flow discovery algorithm f, and a quality metric m, this paper faces the following problem: what are the parameters in f that mostly influence its application in terms of m when applied ... -
A methodology for distributed fault diagnosis
(2016)
Conference report
Restricted access - publisher's policyIn this paper, a methodology for distributed fault diagnosis is proposed. The algorithm places the sensors in a system in such a manner that the partition of a system into various subsystems becomes ... -
A one pass algorithm for type checking with overloading and polymorphism
(1992-05-24)
Research report
Open AccessThis paper presents an algorithm to do type checking with overloaded functions. It also handles type variables, which enables it to handle polymorphic functions and other interesting problems as incomplete programs. The ... -
A parallel dynamic asynchronous framework for uncertainty quantification by hierarchical Monte Carlo algorithms
(Springer Nature, 2021-09-13)
Article
Open AccessThe necessity of dealing with uncertainties is growing in many different fields of science and engineering. Due to the constant development of computational capabilities, current solvers must satisfy both statistical ... -
A study of feature selection algorithms for accuracy estimation
(Universitat Politècnica de Catalunya, 2012-09)
Master thesis
Open AccessThe main purpose of Feature Subset Selection is to find a reduced subset of attributes from a data set described by a feature set. The task of a feature selection algorithm (FSA) is to provide with a computational ... -
A study on the performance of Oracle Grid Engine for computing intensive applications
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
Conference report
Open AccessComputing intensive applications are an important family of applications in distributed computing domain. They have been object of study using different distributed computing paradigms and infrastructures. Such applications ... -
A survey of isosurface fitting algorithms
(1998-03)
Research report
Open AccessImplicit surface poligonalization is an useful technique for visualizing sampled volumetric data in many scientific applications. In this report we describe some of the different algorithms for constructing poligonazed ... -
A Tabu Search algorithm for ground station scheduling problem
(2014)
Conference report
Open AccessMission planning plays an important role in satellite control systems. Satellites are not autonomously operated in many cases but are controlled by tele-commands transmitted from ground stations. Therefore, mission scheduling ... -
A Tabu search algorithm for scheduling independent jobs in computational grids
(2009)
Article
Open AccessThe efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications, and it is a computationally hard problem even when there are no dependencies among jobs. We present in this ...