738 search results - page 98 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
74
Voted
AI
2003
Springer
15 years 3 months ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
PDPTA
2003
14 years 11 months ago
2003
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...
AAAI
2008
15 years 2 days ago
2008
A drama manager (DM) monitors an interactive experience, such as a computer game, and intervenes to shape the global experience so it satisfies the author's expressive goals ...
173
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...