Sciweavers

1795 search results - page 246 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
137
Voted
IPPS
2003
IEEE
15 years 6 months ago
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...
SSDBM
2003
IEEE
105views Database» more  SSDBM 2003»
15 years 6 months ago
Using Bitmap Index for Interactive Exploration of Large Datasets
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...
Kesheng Wu, Wendy S. Koegler, Jacqueline Chen, Ari...
112
Voted
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 5 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
ICALP
1993
Springer
15 years 4 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
FMICS
2006
Springer
15 years 4 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang