7421 search results - page 214 / 1485 » In search of dependable design |
236
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
212
click to vote
CDVE
2007
Springer
16 years 1 months ago
2007
Springer
In order to build complex, large-scale, dependable systems it is necessary to use a development environment with an integrated set of capabilities that supports editing and formal...
225
click to vote
SIGSOFT
2003
ACM
16 years 8 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
202
click to vote
AMW
2009
15 years 5 months ago
2009
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
187
click to vote
AMAI
2004
Springer
16 years 20 days ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...