866 search results - page 82 / 174 » Bidirectionalizing graph transformations |
IJCAI
2003
14 years 11 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
APN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. High-Level net models following the paradigm “nets as tokens” have been studied already in the literature with several interesting applications. In this paper we prop...
ICVGIP
2004
14 years 11 months ago
2004
We present a new active active recognition scheme (using an uncalibrated camera) based on a new idea, appearancebased aspect graphs. The scheme is robust to background clutter, an...
107
click to vote
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...