1940 search results - page 224 / 388 » Graph Transformation with Variables |
139
Voted
IJCAI
2001
15 years 5 months ago
2001
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compil...
124
click to vote
VLSISP
2008
15 years 4 months ago
2008
Abstract. In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound ...
147
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
149
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
143
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...