Sciweavers

559 search results - page 41 / 112
» Augmented Marked Graphs
Sort
View
CGA
2006
13 years 9 months ago
From Linear Story Generation to Branching Story Graphs
Interactive narrative systems are storytelling systems in which the user can influence the content or ordering of story world events. Conceptually, an interactive narrative can be...
Mark O. Riedl, R. Michael Young
JGAA
2006
127views more  JGAA 2006»
13 years 8 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
COLING
1992
13 years 10 months ago
A Treatment Of Negative Descriptions Of Typed Feature Structures
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
Kiyoshi Kogure
DATE
2010
IEEE
135views Hardware» more  DATE 2010»
14 years 2 months ago
Mapping scientific applications on a large-scale data-path accelerator implemented by single-flux quantum (SFQ) circuits
— To overcome issues originating from the CMOS technology, a large-scale reconfigurable data-path (LSRDP) processor based on single-flux quantum circuits is introduced. LSRDP is ...
Farhad Mehdipour, Hiroaki Honda, Hiroshi Kataoka, ...
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 1 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis