738 search results - page 33 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
126
Voted
CHARME
2001
Springer
15 years 7 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
138
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
116
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
128
Voted
ICPP
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—This paper analyzes energy characteristics of parallel algorithms executed on scalable multicore processors. Specifically, we provide a methodology for evaluating energ...
112
click to vote
WILF
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a computer implementation that utilizes cross-reference ambiguity in utterances for simple conversational jokes. The approach is based on the SSTH. Using a simp...