738 search results - page 16 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
WG
2004
Springer
15 years 3 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
123
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
82
Voted
IJCAI
2003
14 years 11 months ago
2003
Filtering denotes any method whereby an agent updates its belief state—its knowledge of the state of the world—from a sequence of actions and observations. In logical filterin...
IRI
2006
IEEE
15 years 3 months ago
2006
IEEE
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
DAC
2007
ACM
15 years 1 months ago
2007
ACM
This paper looks at the CAD implications of possible new interconnect technologies. We consider three technologies in particular: three dimensional ICs, carbon nanotubes as a repl...