Sciweavers

393 search results - page 40 / 79
» Defining Models - Meta Models versus Graph Grammars
Sort
View
CMOT
2002
112views more  CMOT 2002»
14 years 9 months ago
Finding Optimal Targets for Change Agents: A Computer Simulation of Innovation Diffusion
We introduce a diffusion of innovation model based on a network threshold approach. Realistic network and threshold data were gathered regarding the diffusion of new software tool...
Dirk Maienhofer, Thomas A. Finholt
ENTCS
2006
183views more  ENTCS 2006»
14 years 9 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...
83
Voted
ATAL
2005
Springer
15 years 3 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
SIROCCO
2008
14 years 11 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
ICML
2004
IEEE
15 years 10 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu