Sciweavers

2465 search results - page 264 / 493
» Automata on Linear Orderings
Sort
View
WIA
2001
Springer
15 years 5 months ago
Adaptive Rule-Driven Devices - General Formulation and Case Study
A formal device is said to be adaptive whenever its behavior changes dynamically, in a direct response to its input stimuli, without interference of external agents, even its user...
João José Neto
ICDCS
2000
IEEE
15 years 4 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
131
Voted
ISTCS
1992
Springer
15 years 4 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
104
Voted
ACL
2003
15 years 2 months ago
Generalized Algorithms for Constructing Statistical Language Models
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
Cyril Allauzen, Mehryar Mohri, Brian Roark
124
Voted
JAIR
2008
157views more  JAIR 2008»
15 years 23 days ago
Learning to Reach Agreement in a Continuous Ultimatum Game
It is well-known that acting in an individually rational manner, according to the principles of classical game theory, may lead to sub-optimal solutions in a class of problems nam...
Steven de Jong, Simon Uyttendaele, Karl Tuyls