182 search results - page 19 / 37 » A Theory of Strict P-completeness |
AGENTCL
2003
Springer
14 years 25 days ago
2003
Springer
We propose group communication for agent coordination within “active rooms” and other pervasive computing scenarios featuring strict real-time requirements, inherently unrelia...
COLT
2003
Springer
14 years 25 days ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
CMOT
1998
13 years 7 months ago
1998
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
JMLR
2002
13 years 7 months ago
2002
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
QUESTA
2008
13 years 7 months ago
2008
We analyze the output process of finite capacity birth-death Markovian queues. We develop a formula for the asymptotic variance rate of the form + vi where is the rate of outputs...