152 search results - page 12 / 31 » Efficiently Exploiting Dependencies in Local Search for SAT |
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
IAJIT
2010
14 years 8 months ago
2010
: The coding gain of the H.264/AVC video encoder mainly comes from the new incorporated prediction tools. However, their enormous computation and ultrahigh memory bandwidth are the...
103
click to vote
SCIA
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, two block-based texture methods are proposed for content-based image retrieval (CBIR). The approaches use the Local Binary Pattern (LBP) texture feature as the sourc...
AAAI
2010
14 years 11 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
AAAI
2006
14 years 11 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...