Functional Approach towards Approximation Problems: Suitability of applying functional languages for implementation of approximation algorithms - Couverture souple

Akram, Muhammad; Imran Shafi, Muhammad

 
9783838363509: Functional Approach towards Approximation Problems: Suitability of applying functional languages for implementation of approximation algorithms
Couverture souple
ISBN 10 : 3838363507 ISBN 13 : 9783838363509
Editeur : LAP LAMBERT Academic Publishing, 2010

Synopsis

Approximation algorithms are widely used for problems related to computational geometry, complex optimization problems, discrete min-max problems, NP- hard and space hard problems. Due to the complex nature of such problems, imperative languages are perhaps not the best solution when it comes to their actual implementation. Functional languages like Haskell could be a good candidate for the aforementioned issues. Haskell is used in industries as well in commercial applications, e.g. concurrent applications, statistics, symbolic math and financial analysis. Several approximation algorithms have been proposed for different problems that naturally arise in the DNA clone classifications. In this book, we have performed an initial and explorative study on applying functional languages for approximation algorithms. Specifically, we have implemented a well known approximate clustering algorithm in Haskell and in Java and we discuss the suitability of applying functional languages for the implementation of approximation algorithms, in particular for graph theoretical approximate clustering problems with applications in DNA clone classification.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Approximation algorithms are widely used for problems related to computational geometry, complex optimization problems, discrete min-max problems, NP- hard and space hard problems. Due to the complex nature of such problems, imperative languages are perhaps not the best solution when it comes to their actual implementation. Functional languages like Haskell could be a good candidate for the aforementioned issues. Haskell is used in industries as well in commercial applications, e.g. concurrent applications, statistics, symbolic math and financial analysis. Several approximation algorithms have been proposed for different problems that naturally arise in the DNA clone classifications. In this book, we have performed an initial and explorative study on applying functional languages for approximation algorithms. Specifically, we have implemented a well known approximate clustering algorithm in Haskell and in Java and we discuss the suitability of applying functional languages for the implementation of approximation algorithms, in particular for graph theoretical approximate clustering problems with applications in DNA clone classification.

Biographie de l'auteur

Muhammad Akram and M. Imran Shafi: Studied Master of Science in Computer Science at Blekinge Institute of Technology, Sweden. Both have research interests in network security and programming languages. Akram is currently working as a Lecturer in Najran University KSA and Imran is working as a Lecturer in Punjab University Pakistan.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
3838363507
ISBN 13 
9783838363509
Reliure
Broché
Nombre de pages
112
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne