Sciweavers

3379 search results - page 47 / 676
» Combinators for Interaction Nets
Sort
View
APN
2008
Springer
15 years 1 months ago
Faster Unfolding of General Petri Nets Based on Token Flows
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
Robin Bergenthum, Robert Lorenz, Sebastian Mauser
ICUMT
2009
14 years 9 months ago
Homura and Net-Homura: The creation and web-based deployment of cross-platform 3D games
Digital distribution is becoming an increasingly important method within the games industry. The leading consoles each possess their own bespoke platform to digitally deploy games ...
Chris Carter, Abdennour El Rhalibi, Madjid Merabti...
OHS
2001
Springer
15 years 4 months ago
Developing Adaptive Internet Based Courses with the Authoring System NetCoach
Developing adaptive internet based learning courses usually requires a lot of programming efforts to provide session management, keeping track of the learners current state, and ad...
Gerhard Weber, Hans-Christian Kuhl, Stephan Weibel...
ACL
2006
15 years 1 months ago
LexNet: A Graphical Environment for Graph-Based NLP
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarizatio...
Dragomir R. Radev, Günes Erkan, Anthony Fader...
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 12 months ago
Taming Modal Impredicativity: Superlazy Reduction
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
Ugo Dal Lago, Luca Roversi, Luca Vercelli