9405 search results - page 464 / 1881 » Computing a Model of Set Theory |
186
click to vote
BIRTHDAY
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
197
click to vote
SPAA
2003
ACM
16 years 26 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
216
click to vote
ACTA
2007
15 years 7 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
203
click to vote
Lecture Notes
"These lecture notes treat various versions of the so-called “fundamental theorem
of asset pricing”. Many students are familiar with statements about models for
financia...
193
click to vote
CASCON
1996
15 years 9 months ago
1996
This paper proposes the idea of vision agents over Internet, outlines the performance models of Live WWW with agents, and describes an object search agent and its communications w...