9842 search results - page 381 / 1969 » The Complexity of the Matching-Cut Problem |
149
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
144
click to vote
CORR
2012
Springer
14 years 4 days ago
2012
Springer
This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing thi...
130
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
127
click to vote
GPEM
2008
15 years 4 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
127
click to vote
ICSM
1996
IEEE
15 years 8 months ago
1996
IEEE
It is well known that the extensive use of preprocessors can lead to serious maintenance problems. However, these tools are still heavily used by developers and maintainers to imp...