Sciweavers

JAIR
2006
92views more  JAIR 2006»
13 years 11 months ago
Dynamic Local Search for the Maximum Clique Problem
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
Wayne J. Pullan, Holger H. Hoos
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
14 years 4 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
CP
2003
Springer
14 years 4 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
SGAI
2004
Springer
14 years 4 months ago
A combinatorial approach to conceptual graph projection checking
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
Madalina Croitoru, Ernesto Compatangelo