Sciweavers

9842 search results - page 82 / 1969
» Problem complexity
Sort
View
GECCO
2008
Springer
142views Optimization» more  GECCO 2008»
14 years 11 months ago
Complexity of Max-SAT using stochastic algorithms
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
Mohamed Qasem, Adam Prügel-Bennett
DAM
2006
136views more  DAM 2006»
14 years 9 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
IJFCS
2006
70views more  IJFCS 2006»
14 years 9 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
PAMI
2000
85views more  PAMI 2000»
14 years 9 months ago
Learning and Classification of Complex Dynamics
Ben North, Andrew Blake, Michael Isard, Jens Ritts...
FOCS
2010
IEEE
14 years 7 months ago
The Monotone Complexity of k-clique on Random Graphs
It is widely suspected that Erdos-R
Benjamin Rossman