Sciweavers

738 search results - page 79 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
CCGRID
2010
IEEE
14 years 11 months ago
Bandwidth Allocation for Iterative Data-Dependent E-science Applications
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...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
ICPPW
2009
IEEE
14 years 7 months ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
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...
Liliana Cucu-Grosjean, Olivier Buffet
DAC
2001
ACM
15 years 10 months ago
Chaff: Engineering an Efficient SAT Solver
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao,...
AINA
2008
IEEE
15 years 4 months ago
Multi-Character Processor Array for Pattern Matching in Network Intrusion Detection System
—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 ...
Yeim-Kuan Chang, Ming-Li Tsai, Yu-Ru Chung
IPPS
2006
IEEE
15 years 3 months ago
Broadcasting and routing in faulty mesh networks
— 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...
Milos Stojmenovic, Amiya Nayak