View in EDS PDF Full Text

Eliminating Introns in Ant Colony Programming.

Saved in:
Bibliographic Details
Title: Eliminating Introns in Ant Colony Programming.
Authors: Boryczka, Mariusz1 boryczka@us.edu.pl
Source: Fundamenta Informaticae. 2005, Vol. 68 Issue 1-2, p1-19. 19p. 7 Diagrams, 5 Charts.
Subjects: Automatic programming (Computer science), Computer programming, Colonies (Biology), Ants, Introns
Abstract: Ant Colony Programming is a relatively new paradigm based on Genetic Programming and Ant Colony System. We discuss the problemof eliminating introns in Ant Colony Programming. The approach is tested on several approximation problems. The test results demonstrate that the proposed method simplifies significantly the achieved solutions and shortens their evaluation time. [ABSTRACT FROM AUTHOR]
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 18316595
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Eliminating Introns in Ant Colony Programming.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Boryczka%2C+Mariusz%22">Boryczka, Mariusz</searchLink><relatesTo>1</relatesTo><i> boryczka@us.edu.pl</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2005, Vol. 68 Issue 1-2, p1-19. 19p. 7 Diagrams, 5 Charts.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Automatic+programming+%28Computer+science%29%22">Automatic programming (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Colonies+%28Biology%29%22">Colonies (Biology)</searchLink><br /><searchLink fieldCode="DE" term="%22Ants%22">Ants</searchLink><br /><searchLink fieldCode="DE" term="%22Introns%22">Introns</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Ant Colony Programming is a relatively new paradigm based on Genetic Programming and Ant Colony System. We discuss the problemof eliminating introns in Ant Colony Programming. The approach is tested on several approximation problems. The test results demonstrate that the proposed method simplifies significantly the achieved solutions and shortens their evaluation time. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=18316595
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3233/fun-2005-681-201
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 1
    Subjects:
      – SubjectFull: Automatic programming (Computer science)
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Colonies (Biology)
        Type: general
      – SubjectFull: Ants
        Type: general
      – SubjectFull: Introns
        Type: general
    Titles:
      – TitleFull: Eliminating Introns in Ant Colony Programming.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Boryczka, Mariusz
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: 2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 01692968
          Numbering:
            – Type: volume
              Value: 68
            – Type: issue
              Value: 1-2
          Titles:
            – TitleFull: Fundamenta Informaticae
              Type: main
ResultId 1