1795 search results - page 200 / 359 » On the Complexity of Circuit Satisfiability |
IFIP
2001
Springer
14 years 2 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
RTSS
1999
IEEE
14 years 2 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
DLOG
2006
13 years 11 months ago
2006
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
SAC
2010
ACM
13 years 10 months ago
2010
ACM
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...