2414 search results - page 109 / 483 » Computing Normal Subgroups |
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
CISIS
2010
IEEE
2010
IEEE
Computational Grid as an Appropriate Infrastructure for Ultra Large Scale Software Intensive Systems
14 years 3 months ago
—Ultra large scale (ULS) systems are future software intensive systems that have billions of lines of code, composed of heterogeneous, changing, inconsistent and independent elem...
ICARIS
2007
Springer
14 years 3 months ago
2007
Springer
Today’s signature-based intrusion detection systems are reactive in nature and storage-limited. Their operation depends upon catching an instance of an intrusion or virus and en...
ICTAI
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
COMPSAC
2005
IEEE
13 years 11 months ago
2005
IEEE
Fault-tolerant mobile computing systems have different requirements and restrictions, not taken into account by conventional distributed systems. This paper presents a coordinate...