874 search results - page 110 / 175 » Graph Transformation in a Nutshell |
113
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...
122
Voted
APVIS
2004
15 years 5 months ago
2004
The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of da...
132
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...
118
click to vote
VLSISP
2008
15 years 3 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 ...
136
Voted
TAMC
2010
Springer
15 years 1 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...