On Randomization and Derandomization of Algorithms of Combinatorial Optimization Problems
Hanaa Abd Elhady Abd Elbaser Essa;
Abstract
The main object of this thesis is to show the important role
of the randomization in the design of algorithms. Simplicity
and speed are the two benefits of randomization. For
many applications, randomized algorithms are the simplest
algorithms available,
of the randomization in the design of algorithms. Simplicity
and speed are the two benefits of randomization. For
many applications, randomized algorithms are the simplest
algorithms available,
Other data
| Title | On Randomization and Derandomization of Algorithms of Combinatorial Optimization Problems | Other Titles | عن عشوائية وإزالة عشوائية خوارزميات مشاكل التألفيات الأمثلية | Authors | Hanaa Abd Elhady Abd Elbaser Essa | Keywords | On Randomization and Derandomization of Algorithms of Combinatorial Optimization Problems | Issue Date | 2009 | Description | The main object of this thesis is to show the important role of the randomization in the design of algorithms. Simplicity and speed are the two benefits of randomization. For many applications, randomized algorithms are the simplest algorithms available, |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.