Sciweavers

1550 search results - page 50 / 310
» Benchmarking for Graph Transformation
Sort
View
ICMT
2011
Springer
13 years 2 months ago
Toward Bidirectionalization of ATL with GRoundTram
ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form ca...
Isao Sasano, Zhenjiang Hu, Soichiro Hidaka, Kazuhi...
ML
2010
ACM
142views Machine Learning» more  ML 2010»
13 years 9 months ago
Graph regularization methods for Web spam detection
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as wel...
Jacob Abernethy, Olivier Chapelle, Carlos Castillo
IDEAL
2003
Springer
14 years 4 months ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin
ICPR
2010
IEEE
14 years 1 months ago
Incremental Distance Transforms (IDT)
Abstract--A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incremental Distance Transforms (IDT). This scheme is applied on the citybl...
Theo Schouten, Egon L. Van Den Broek
JAPLL
2006
114views more  JAPLL 2006»
13 years 11 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle