Articolul precedent |
Articolul urmator |
322 0 |
SM ISO690:2012 BONDARENCO, Vladimir, RUSU, Andrei, RUSU, Elena. Genetic algorithm for optimization of software process. In: Conference on Applied and Industrial Mathematics: CAIM 2018, 20-22 septembrie 2018, Iași, România. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2018, Ediţia a 26-a, p. 116. ISBN 978-9975-76-247-2. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Conference on Applied and Industrial Mathematics Ediţia a 26-a, 2018 |
|||||||
Conferința "Conference on Applied and Industrial Mathematics" Iași, România, Romania, 20-22 septembrie 2018 | |||||||
|
|||||||
Pag. 116-116 | |||||||
|
|||||||
Descarcă PDF | |||||||
Rezumat | |||||||
The study conducted in this paper started from a real-life problem encounted by a software test manager. Testing a software consist in passing a set of tests, many of them are interdependent, they have di erent weights and the software testing team have a limited time resource. It is clear that it takes di erent times to pass di erent tests. The goal of the team is to conduct tests in the allowed time interval following a path such that the overall weight of passed tests is maximal. In the present paper we present a mathematical model of the problem and propose a solution to it based on developed evolutionary algorithm. |
|||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Bondarenco, V.</dc:creator> <dc:creator>Rusu, A.G.</dc:creator> <dc:creator>Rusu, E.</dc:creator> <dc:date>2018</dc:date> <dc:description xml:lang='en'><p>The study conducted in this paper started from a real-life problem encounted by a software test manager. Testing a software consist in passing a set of tests, many of them are interdependent, they have di erent weights and the software testing team have a limited time resource. It is clear that it takes di erent times to pass di erent tests. The goal of the team is to conduct tests in the allowed time interval following a path such that the overall weight of passed tests is maximal. In the present paper we present a mathematical model of the problem and propose a solution to it based on developed evolutionary algorithm.</p></dc:description> <dc:source>Conference on Applied and Industrial Mathematics (Ediţia a 26-a) 116-116</dc:source> <dc:title>Genetic algorithm for optimization of software process</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>