738 search results - page 79 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
123
Voted
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework inco...
153
click to vote
ICPPW
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
135
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
124
click to vote
AINA
2008
IEEE
15 years 10 months ago
2008
IEEE
—Network Intrusion Detection System (NIDS) is a system developed for identifying attacks by using a set of rules. NIDS is an efficient way to provide the security protection for ...
144
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Broadcasting is a data communication task in which one processor sends the same message to all other processors. Routing is a task where a source processor sends a message to a...