Sciweavers

1701 search results - page 199 / 341
» Computer Science and State Machines
Sort
View
MFCS
2009
Springer
15 years 4 months ago
Private Capacities in Mechanism Design
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The pro...
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
IMSCCS
2007
IEEE
15 years 4 months ago
Control Flow Checking Algorithm using Soft-based Intra-/Inter-block Assigned-Signature
In radiation environments, alpha particles, cosmic rays and solar wind flux can cause a single event upset (SEU), which is one of the major sources of bit-flips in digital electro...
Yanxia Wu, Guochang Gu, Shaobin Huang, Jun Ni
TLCA
2005
Springer
15 years 3 months ago
Call-by-Name and Call-by-Value as Token-Passing Interaction Nets
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
François-Régis Sinot
STACS
1997
Springer
15 years 2 months ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt
TLCA
1997
Springer
15 years 2 months ago
Games and Weak-Head Reduction for Classical PCF
We present a game model for classical PCF, a nite version of PCF extended by a catch/throw mechanism. This model is build from E-dialogues, a kind of two-players game de ned by Lor...
Hugo Herbelin