In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
This paper introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and th...
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...