34 search results - page 5 / 7 » Resolution versus Search: Two Strategies for SAT |
DAC
2001
ACM
14 years 8 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
MHCI
2009
Springer
14 years 2 months ago
2009
Springer
Speech and typed text are two common input modalities for mobile phones. However, little research has compared them in their ability to support annotation and retrieval of digital...
AIPS
2000
13 years 9 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
ICTAI
1997
IEEE
13 years 11 months ago
1997
IEEE
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...