Sciweavers

1161 search results - page 86 / 233
» Kinetic Dependence Graphs
Sort
View
103
Voted
GD
2000
Springer
15 years 4 months ago
User Preference of Graph Layout Aesthetics: A UML Study
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
77
Voted
WSC
2007
15 years 2 months ago
Alternative thread scoring methods in qualitative event graphs
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
Ricki G. Ingalls, Douglas J. Morrice
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 2 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 21 days ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
GPEM
2006
82views more  GPEM 2006»
15 years 18 days ago
Shortcomings with using edge encodings to represent graph structures
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
Gregory Hornby