Sciweavers

332 search results - page 7 / 67
» Compositions of Graphs Revisited
Sort
View
GG
2004
Springer
14 years 22 days ago
Composition of Path Transductions
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
Tanguy Urvoy
ICCS
1997
Springer
13 years 11 months ago
Applying Conceptual Graph Theory to the User-Driven Specification of Network Information Systems
Users need to be strongly involved in the specification process of network information systems. Characteristics of user-driven specification are described, and process composition ...
Aldo de Moor
APPML
2008
82views more  APPML 2008»
13 years 7 months ago
The k-tuple domination number revisited
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
Vadim E. Zverovich
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
AIIDE
2007
13 years 9 months ago
Level Annotation and Test by Autonomous Exploration: Abbreviated Version
This paper proposes the use of an autonomous exploring agent to generate and annotate the waypoint graph as an offline process during level development. The explorer incrementally...
Christian Darken