1983 search results - page 132 / 397 » Competitive graph searches |
ALENEX
2007
13 years 9 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
PVLDB
2010
13 years 6 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
EOR
2007
13 years 8 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...