102 search results - page 10 / 21 » A Stochastic Local Search Approach to Vertex Cover |
CP
2000
Springer
14 years 9 days ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Time...
BIBE
2006
IEEE
14 years 2 months ago
2006
IEEE
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...