920 search results - page 162 / 184 » Generating Satisfiable Problem Instances |
COMPSAC
2009
IEEE
14 years 2 months ago
2009
IEEE
As computing technology becomes increasingly pervasive and interconnected, mobility leads to shorter-lasting relationships between end-points with many different security requirem...
PODS
2010
ACM
13 years 9 months ago
2010
ACM
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
ASE
2005
13 years 7 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...