Sciweavers

1940 search results - page 166 / 388
» Graph Transformation with Variables
Sort
View
128
Voted
JSAT
2006
87views more  JSAT 2006»
15 years 3 months ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
124
Voted
ACL
2010
15 years 1 months ago
Untangling the Cross-Lingual Link Structure of Wikipedia
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Gerard de Melo, Gerhard Weikum
132
Voted
IPMU
2010
Springer
15 years 1 months ago
Possibilistic Graphical Models and Compositional Models
We overview three kinds of possibilistic graphical models (based on directed acyclic graphs) and present, how they can be expressed by means of non-graphical approach to multidimen...
Jirina Vejnarová
233
Voted
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
13 years 6 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
141
Voted
AI
2003
Springer
15 years 9 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin