In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod