Functional Approach Approximation Problems by Akram Muhammad (5 results)

Taschenbuch. Condition: Neu. Functional Approach towards Approximation Problems | Suitability of applying functional languages for implementation of approximation algorithms | Muhammad Akram (u. a.) | Taschenbuch | 112 S. | Englisch | 2013 | LAP LAMBERT Academic Publishing | EAN 9783838363509 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 112 pp. Englisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Akram MuhammadMuhammad 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 curre.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 112 pp. Englisch.

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.