228 search results - page 24 / 46 » A Heuristic Algorithm to Design AND-OR-EXOR Three-Level Netw... |
117
click to vote
MOBIHOC
2002
ACM
15 years 10 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
ICCAD
1994
IEEE
15 years 3 months ago
1994
IEEE
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
NCA
2010
IEEE
14 years 9 months ago
2010
IEEE
The Support Vector Machine (SVM) is an interesting classifier with excellent power of generalization. In this paper, we consider applying the SVM to semi-supervised learning. We p...
DAC
1998
ACM
16 years 1 days ago
1998
ACM
The logic blocks CLBs of a lookup table LUT based FPGA consist of one or more LUTs, possibly of di erent sizes. In this paper, we focus on technology mapping for CLBs with several...