14084 search results - page 228 / 2817 » A Theory for Game Theories |
185
click to vote
CIE
2005
Springer
16 years 5 days ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
179
click to vote
ICALP
2004
Springer
16 years 6 hour ago
2004
Springer
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
171
click to vote
ISMIS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
157
click to vote
ICCS
1997
Springer
15 years 10 months ago
1997
Springer
Users need to be strongly involved in the specification process of network information systems. Characteristics of user-driven specification are described, and process composition ...
165
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...