941 search results - page 149 / 189 » Mathematics on the (Semantic) NET |
125
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
151
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
132
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
106
click to vote
PAPM
2001
Springer
15 years 8 months ago
2001
Springer
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
121
click to vote
ASMTA
2009
Springer
15 years 8 months ago
2009
Springer
Discrete stochastic models (DSM) are widely used in various application fields today. Proxel-based simulation can outperform discrete event-based approaches in the analysis of smal...