Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

2015

GreenDroid: A Tool for Analysing Power Consumption in the Android Ecosystem

Autores
Couto, M; Cunha, J; Fernandes, JP; Pereira, R; Saraiva, J;

Publicação
2015 IEEE 13th International Scientific Conference on Informatics

Abstract
This paper presents GreenDroid, a tool for monitoring and analyzing power consumption for the Android ecosystem. This tool instruments the source code of a giving Android application and is able to estimate the power consumed when running it. Moreover, it uses advanced classification algorithms to detect abnormal power consumption and to relate them to fragments in the source code. A set of graphical results are produced that help software developers to identify abnormal power consumption in their source code.

2015

Task partitioning and priority assignment for distributed hard real-time systems

Autores
Garibay Martinez, R; Nelissen, G; Ferreira, LL; Pinho, LM;

Publicação
JOURNAL OF COMPUTER AND SYSTEM SCIENCES

Abstract
In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley's algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

2015

Selection Constructive based Hyper-heuristic for Dynamic Scheduling

Autores
Gomes, S; Madureira, A; Cunha, B;

Publicação
2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI)

Abstract
Manufacturing environments require a real-time adaptation and optimization method to dynamically and intelligently maintain the current scheduling plan feasible. This way, the organization keeps clients satisfied and achieves its objectives (costs are minimized and profits maximized). This paper proposes an optimization approach - Selection Constructive based Hyper-heuristic for Dynamic Scheduling - to deal with these dynamic events, with the main goal of maintaining the current scheduling plan feasible and robust as possible. The development of this dynamic adaptation approach is inspired on evolutionary computation and hyper-heuristics. Our empirical results show that a selection constructive hyper-heuristic could be advantageous on solving dynamic adaptation optimization problems.

2015

Optimal Daily Operation of a Smart-Household under Dynamic Pricing considering Thermostatically and Non-thermostatically Controllable Appliances

Autores
Paterakis, NG; Medeiros, MF; Catalao, JPS; Siaraka, A; Bakirtzis, AG; Erdinc, O;

Publicação
2015 IEEE 5TH INTERNATIONAL CONFERENCE ON POWER ENGINEERING, ENERGY AND ELECTRICAL DRIVES (POWERENG)

Abstract
In this study, a home energy management system structure is developed in order to determine the optimal commitment of a smart-household. Two types of loads are explicitly modeled: non-thermostatically controllable (electric vehicle, shiftable appliances) and thermostatically controllable loads (air conditioner, electric water heater). Furthermore, small-scale self-production is considered by means of a photovoltaic system. A test case using realistic data is presented in order to investigate the combined effect of the aforementioned assets under real-time pricing demand response.

2015

Special track on data streams

Autores
Rodrigues, PP; Bifet, A; Krishnaswamy, S; Gama, J;

Publicação
Proceedings of the ACM Symposium on Applied Computing

Abstract

2015

A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems

Autores
Juan, AA; Faulin, J; Grasman, SE; Rabe, M; Figueira, G;

Publicação
OPERATIONS RESEARCH PERPSECTIVES

Abstract
Many combinatorial optimization problems (COPs) encountered in real-world logistics, transportation, production, healthcare, financial, telecommunication, and computing applications are NP-hard in nature. These real-life COPs are frequently characterized by their large-scale sizes and the need for obtaining high-quality solutions in short computing times, thus requiring the use of metaheuristic algorithms. Meta-heuristics benefit from different random-search and parallelization paradigms, but they frequently assume that the problem inputs, the underlying objective function, and the set of optimization constraints are deterministic. However, uncertainty is all around us, which often makes deterministic models oversimplified versions of real-life systems. After completing an extensive review of related work, this paper describes a general methodology that allows for extending metaheuristics through simulation to solve stochastic COPs. 'Simheuristics' allow modelers for dealing with real-life uncertainty in a natural way by integrating simulation (in any of its variants) into a metaheuristic-driven framework. These optimization-driven algorithms rely on the fact that efficient metaheuristics already exist for the deterministic version of the corresponding COP. Simheuristics also facilitate the introduction of risk and/or reliability analysis criteria during the assessment of alternative high-quality solutions to stochastic COPs. Several examples of applications in different fields illustrate the potential of the proposed methodology. (c) 2015 The Authors. Published by Elsevier Ltd.

  • 2482
  • 4187