The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
— In recent years, several approaches have been developed for genetic algorithms to enhance their performance in dynamic environments. Among these approaches, one kind of methods...
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
With a multitude of technological innovations, one emerging trend in image processing, and medical image processing, in particular, is custom hardware implementation of computatio...
Omkar Dandekar, William Plishker, Shuvra S. Bhatta...
Following the huge commercial success of WLAN, multihop wireless networks are expected to lead in the next wave of deployment. Fundamental methods for traffic engineering must be...