Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/56225
-
Title: 
Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm
-
Citation: 
Markvica, D., Schauer, C., & Raidl, G. (2015). Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 113–114). http://hdl.handle.net/20.500.12708/56225
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Markvica, David 
Schauer, Christian 
Raidl, Günther 
-
Organisational Unit: 
E192-01 - Forschungsbereich Algorithms and Complexity 
-
Published in: 
Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory 
-
Date (published): 
2015
-
Event name: 
Eurocast 2015 
-
Event date: 
8-Feb-2015 - 13-Feb-2015
-
Event place: 
Gran Canaria, Spain, EU
-
Number of Pages: 
2
-
Peer reviewed: 
Yes
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

217
checked on Nov 23, 2023

Download(s)

4
checked on Nov 23, 2023

Google ScholarTM

Check