866 search results - page 75 / 174 » Bidirectionalizing graph transformations |
IH
2007
Springer
15 years 4 months ago
2007
Springer
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
KR
1994
Springer
15 years 1 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
AGTIVE
2007
Springer
15 years 4 months ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
CVPR
2007
IEEE
15 years 12 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...