Sciweavers

344 search results - page 57 / 69
» The Santa Claus problem
Sort
View
JSAT
2008
113views more  JSAT 2008»
13 years 9 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
CORR
1998
Springer
126views Education» more  CORR 1998»
13 years 9 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
PVLDB
2010
84views more  PVLDB 2010»
13 years 8 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
WWW
2011
ACM
13 years 4 months ago
Web information extraction using Markov logic networks
In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...
Sandeepkumar Satpal, Sahely Bhadra, Sundararajan S...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
12 years 8 days ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo