23,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
12 °P sammeln
Andere Kunden interessierten sich auch für
![Database Hiding On Tag Web Using Steganography by Genetic Algorithm]( "Database Hiding On Tag Web Using Steganography by Genetic Algorithm")
Database Hiding On Tag Web Using Steganography by Genetic Algorithm30,99 €![Algorithms for the Quadratic Assignment Problem]( "Algorithms for the Quadratic Assignment Problem")
Algorithms for the Quadratic Assignment Problem40,99 €![A Different Approach to Analyse Data in Road Safety]( "A Different Approach to Analyse Data in Road Safety")
A Different Approach to Analyse Data in Road Safety51,99 €![Automatic Selection of Application Specific Garbage Collectors]( "Automatic Selection of Application Specific Garbage Collectors")
Automatic Selection of Application Specific Garbage Collectors46,99 €![Difference Equations: An Improved Approach in Oscillation Theory]( "Difference Equations: An Improved Approach in Oscillation Theory")
Difference Equations: An Improved Approach in Oscillation Theory26,99 €![Practical Approach To Software Engineering]( "Practical Approach To Software Engineering")
Practical Approach To Software Engineering26,99 €![Hybrid Data Mining Approach For Emotion Analysis]( "Hybrid Data Mining Approach For Emotion Analysis")
Hybrid Data Mining Approach For Emotion Analysis26,99 €
Nurse Rostering is a complex problem which arises in everyday activities and health care system in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. Even though solving the Nurse Rostering Problem has been interested field for research from many years, still the Nurse Rostering done by manually. Meta heuristics GA, have been proved to be very efficient in obtaining near-optimal solutions for a variety of hard combinatorial problems including the NRP. Heuristics Algorithm have shown excellent search abilities, but often lose their efficacy when applied to large and complex problems, Many optimization methods suffer from the curse of dimensionality, which shown that their performance deteriorates quickly as the dimensionality of the search space increases. Need to provide some degree of parallelism in traditional approach. Nowadays, GPGPUs are able to provide the necessary computational resourcesto tackle these high-dimensional problems maintaining a limited execution time and a high portability.