102 search results - page 6 / 21 » A Stochastic Local Search Approach to Vertex Cover |
163
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
172
click to vote
TEC
2010
15 years 16 days ago
2010
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
153
click to vote
EVOW
2007
Springer
15 years 12 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
140
click to vote
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
146
Voted
CGI
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper tackles a particular shape matching problem: given a data base of shapes (described as triangular meshes), we search for all shapes which describe a human. We do so by a...