Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
The rapid growth of the World Wide Web in recent years has caused a significant shift in the composition of Internet traffic. Although past work has studied the behavior of TCP dy...
Hari Balakrishnan, Venkata N. Padmanabhan, Sriniva...
Mutation-based Evolutionary Algorithms, also known as Evolutionary Programming (EP) are commonly applied to Artificial Neural Networks (ANN) parameters optimization. This paper pre...
Kristina Davoian, Alexander Reichel, Wolfram-Manfr...
Deformable models are an attractive approach to recognizing nonrigid objects which have considerable within class variability. However, there are severe search problems associated...
Christopher K. I. Williams, Michael Revow, Geoffre...