Sciweavers

344 search results - page 19 / 69
» The Santa Claus problem
Sort
View
108
Voted
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
16 years 13 days ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
EUROPAR
2006
Springer
15 years 7 months ago
Coupling Contracts for Deployment on Alien Grids
We propose coupling based on contracts as a mechanism to address the problem of exchanging information between parties that require information to work together. Specifically, we s...
Javier Bustos-Jiménez, Denis Caromel, Mario...
122
Voted
ICML
2010
IEEE
15 years 4 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 3 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
104
Voted
AAAI
2008
15 years 5 months ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar