Sciweavers

3 search results - page 1 / 1
» A Restarted Strategy for Efficient Subsumption Testing
Sort
View
FUIN
2008
98views more  FUIN 2008»
13 years 5 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
ICML
2008
IEEE
14 years 6 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
TEC
2010
126views more  TEC 2010»
13 years 4 days ago
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
Mohamed Qasem, Adam Prügel-Bennett