Sciweavers

1041 search results - page 22 / 209
» Randomizing Reductions of Search Problems
Sort
View
IJAMCIGI
2010
94views more  IJAMCIGI 2010»
13 years 2 months ago
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover
IPL
2008
131views more  IPL 2008»
13 years 7 months ago
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
J. Francisco Chicano, Enrique Alba
EVOW
2004
Springer
14 years 1 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
STACS
2005
Springer
14 years 1 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
ECIR
2004
Springer
13 years 9 months ago
Applying the Divergence from Randomness Approach for Content-Only Search in XML Documents
Content-only retrieval of XML documents deals with the problem of locating the smallest XML elements that satisfy the query. In this paper, we investigate the application of a spec...
Mohammad Abolhassani, Norbert Fuhr