All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Dichotomous search in ABC and its application in parameter estimation of software reliability growth models

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86092956" target="_blank" >RIV/61989100:27240/11:86092956 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/NaBIC.2011.6089460" target="_blank" >http://dx.doi.org/10.1109/NaBIC.2011.6089460</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/NaBIC.2011.6089460" target="_blank" >10.1109/NaBIC.2011.6089460</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Dichotomous search in ABC and its application in parameter estimation of software reliability growth models

  • Original language description

    ABC (Artificial Bee Colony) is one of the most recent nature inspired algorithm (NIA) based on swarming metaphor. Proposed by Karaboga in 2005, ABC has proven to be a robust and efficient algorithm for solving global optimization problems over continuousspace. In this paper, we propose a modified version of the ABC to improve its performance, in terms of converging to individual optimal point and to compensate the limited amount of search moves of original ABC. In modified version called Dichotomous ABC (DABC), the idea is to move dichotomously in both directions to generate a new trial point. The performance of the proposed algorithm is analyzed on five standard benchmark problems and also we explored the applicability of the proposed algorithm to estimate the parameters of software reliability growth models (SRGM). The proposed algorithm presents significant advantages in handling variety of modeling problems such as the exponential model, power model and Delayed S Shaped model. 201

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 2011 Third World Congress on Nature and Biologically Inspired Computing

  • ISBN

    978-1-4577-1122-0

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    207-212

  • Publisher name

    IEEE

  • Place of publication

    New York

  • Event location

    Salamanca

  • Event date

    Oct 19, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article