1701 search results - page 156 / 341 » Computer Science and State Machines |
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
AIM
2006
14 years 10 months ago
2006
Undergraduate Artificial Intelligence Robotics: Layers Of Abstraction Over Two Channels Frederick L. Crabbe Computer Science Department United States Naval Academy 572C Holloway Rd...
104
click to vote
TCS
2008
14 years 8 months ago
2008
We introduce an extension of the derivatives of rational expressions to expressions denoting formal power series over partially commuting variables. The expressions are purely non...
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
GI
2009
Springer
14 years 8 months ago
2009
Springer
: Both, games in a game theoretic sense and protocols in an informational sense describe rule based interactions between systems. Some similarities and differences of both approach...