Sciweavers

106 search results - page 18 / 22
» Heavy-Tailed Phenomena in Satisfiability and Constraint Sati...
Sort
View
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 7 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
AAAI
1997
13 years 8 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag
ICLP
2004
Springer
14 years 13 days ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
IJSN
2006
87views more  IJSN 2006»
13 years 7 months ago
Workflow authorisation in mediator-free environments
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...
Mohamed Shehab, Elisa Bertino, Arif Ghafoor
AAAI
2007
13 years 9 months ago
Near-optimal Observation Selection using Submodular Functions
AI problems such as autonomous robotic exploration, automatic diagnosis and activity recognition have in common the need for choosing among a set of informative but possibly expen...
Andreas Krause, Carlos Guestrin