3575 search results - page 423 / 715 » Modeling Concurrency with Geometry |
173
click to vote
AAAI
1997
15 years 8 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
193
click to vote
ISSTA
1998
ACM
15 years 11 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
205
click to vote
UIST
1993
ACM
15 years 10 months ago
1993
ACM
Model-based user interface design is centered around a description of application objects and operations at a level of ion higher than that of code. A good model can be used to su...
165
click to vote
VLDB
1993
ACM
15 years 10 months ago
1993
ACM
Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or work ows that access heterogeneous databases and legac...
172
click to vote
PODC
1990
ACM
15 years 10 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...