Sciweavers

2612 search results - page 228 / 523
» Assemblies as Graph Processes
Sort
View
FORTE
1994
15 years 8 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue
JMLR
2006
190views more  JMLR 2006»
15 years 6 months ago
Causal Graph Based Decomposition of Factored MDPs
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
Anders Jonsson, Andrew G. Barto
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
JOT
2010
126views more  JOT 2010»
15 years 5 months ago
Inferring design patterns using the ReP graph
Abstract Periodic refactoring of a large source code often becomes a necessity especially for long-lived projects. In order to increase maintainability and extensibility of such pr...
Tushar Sharma, Dharanipragada Janakiram
PAMI
2010
133views more  PAMI 2010»
15 years 5 months ago
An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language pr...
Roberto Navigli, Mirella Lapata