Sciweavers

2917 search results - page 9 / 584
» Satisfying Interaction Constraints
Sort
View
88
Voted
ACTA
2007
85views more  ACTA 2007»
14 years 9 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
78
Voted
AI
2007
Springer
14 years 9 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
57
Voted
AI
2007
Springer
14 years 9 months ago
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Ke Xu, Frédéric Boussemart, Fred Hem...
CSUR
2006
52views more  CSUR 2006»
14 years 9 months ago
Propositional Satisfiability and Constraint Programming: A comparative survey
Lucas Bordeaux, Youssef Hamadi, Lintao Zhang
JISE
2010
66views more  JISE 2010»
14 years 4 months ago
Testing Whether a Set of Code Words Satisfies a Given Set of Constraints
Hsin-Wen Wei, Wan-Chen Lu, Pei-Chi Huang, Wei-Kuen...