1308 search results - page 262 / 262 » Let's Have a Conversation |
DLT
2010
14 years 9 days ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
NETGAMES
2006
ACM
14 years 4 months ago
2006
ACM
In recent years, MMORPG has become popular. In order to improve scalability of game system, several P2P-based architectures have been proposed. However, in P2P-based gaming archit...
PODC
2012
ACM
12 years 1 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...