Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Solving the Class Responsibility Assignment Problem Using Metaheuristic Approach (CROSBI ID 183105)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Glavaš, Goran ; Fertalj, Krešimir Solving the Class Responsibility Assignment Problem Using Metaheuristic Approach // CIT. Journal of computing and information technology, 19 (2011), 4; 275-283. doi: 10.2498/cit.1000225

Podaci o odgovornosti

Glavaš, Goran ; Fertalj, Krešimir

engleski

Solving the Class Responsibility Assignment Problem Using Metaheuristic Approach

Assigning responsibilities to classes is among first and arguably most important steps when creating object-oriented software design. This step depends greatly on human judgment and experience. In this paper our objective is to automatize assigning responsibilities to classes using metaheuristic optimization algorithms. Four different algorithms (simple genetic algorithm, hill climbing, simulated annealing and particle swarm optimization), using class coupling and cohesion metrics, were implemented and their results are compared. Implemented algorithms take semantically annotated responsibility dependency graph as input. This paper describes responsibility dependency graph, implemented algorithms and used coupling and cohesion metrics in detail. Paper also reports on a performed case study. Ultimately, based on obtained results from all implemented algorithms, conclusions on search landscape of class responsibility assignment problem are drawn.

class responsibility assignment ; genetic algorithm ; hill climbing ; simulated annealing ; particle swarm optimization

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

19 (4)

2011.

275-283

objavljeno

1330-1136

10.2498/cit.1000225

Povezanost rada

Računarstvo

Poveznice
Indeksiranost