4117 search results - page 516 / 824 » On the Satisfiability of Complex Constraints |
198
click to vote
SSDBM
2003
IEEE
16 years 2 days ago
2003
IEEE
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 ...
206
click to vote
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
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...
216
click to vote
ICALP
1993
Springer
15 years 11 months ago
1993
Springer
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...
200
click to vote
FMICS
2006
Springer
15 years 10 months ago
2006
Springer
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 ...
163
click to vote
JAIR
2008
15 years 6 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...