Sciweavers

NGC
2006
Springer
13 years 9 months ago
Story Planning as Exploratory Creativity: Techniques for Expanding the Narrative Search Space
The authoring of fictional stories is considered a creative process. The purpose of most story authoring is not to invent a new style or genre of story that will be accepted by the...
Mark O. Riedl, R. Michael Young
NGC
2006
Springer
13 years 9 months ago
Geometrical Structure of Boosting Algorithm
Takafumi Kanamori, Takashi Takenouchi, Noboru Mura...
PPL
2008
97views more  PPL 2008»
13 years 9 months ago
The Impact of Dynamic Channels on Functional Topology Skeletons
Parallel functional programs with implicit communication often generate purely hierarchical communication topologies during execution: communication only happens between parent an...
Jost Berthold, Rita Loogen
NGC
2008
Springer
13 years 9 months ago
Synthetic Biology
Daisuke Kiga, Masayuki Yamamura
NGC
2008
Springer
149views Communications» more  NGC 2008»
13 years 9 months ago
A New Type System for JVM Lock Primitives
A bytecode verifier for the Java virtual machine language (JVML) statically checks that bytecode does not cause any fatal error. However, the present verifier does not check correc...
Futoshi Iwama, Naoki Kobayashi
NGC
2008
Springer
119views Communications» more  NGC 2008»
13 years 9 months ago
Abstraction-Carrying Code: a Model for Mobile Code Safety
ion-Carrying Code: a Model for Mobile Code Safety Elvira Albert Germ
Elvira Albert, Germán Puebla, Manuel V. Her...
ITA
2006
167views Communications» more  ITA 2006»
13 years 9 months ago
Characterization of lung tumor subtypes through gene expression cluster validity assessment
The problem of assessing the reliability of clusters patients identified by clustering algorithms is crucial to estimate the significance of subclasses of diseases detectable at b...
Giorgio Valentini, Francesca Ruffino
ITA
2006
100views Communications» more  ITA 2006»
13 years 9 months ago
Sequences of low arithmetical complexity
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
Sergey V. Avgustinovich, Julien Cassaigne, Anna E....
ITA
2006
13 years 9 months ago
Complexity classes for membrane systems
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...