Sciweavers

1041 search results - page 60 / 209
» Randomizing Reductions of Search Problems
Sort
View
COR
2008
175views more  COR 2008»
13 years 8 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
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...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
INFSOF
2008
85views more  INFSOF 2008»
13 years 7 months ago
Locating dependence structures using search-based slicing
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...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
EOR
2010
110views more  EOR 2010»
13 years 8 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
IMCSIT
2010
13 years 5 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
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...
Sorin Ilie, Costin Badica
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Randomized Postoptimization of Covering Arrays
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