1683 search results - page 200 / 337 » Game Theory Basics |
167
click to vote
COMBINATORICA
2004
15 years 6 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
169
click to vote
ENTCS
2002
15 years 6 months ago
2002
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for p...
167
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
The basic theory of supervisory control of discrete-event systems is extended with the notion of templates, which simplifies the modeling of controllers since one can work with co...
145
click to vote
IANDC
2010
15 years 5 months ago
2010
Inspired by the classical theory of modules over a monoid, we introduce the natural notion of module over a monad. The associated notion of morphism of left modules (”linear” n...
159
click to vote
RP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically ...