Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA mainta...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transform...
Prachya Chalermwat, Tarek A. El-Ghazawi, Jacquelin...
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
: Privacy is one of the most important properties of an information system must satisfy, in which systems the need to share information among different, not trusted entities, the p...