1399 search results - page 92 / 280 » Multi-party Finite Computations |
WIA
2005
Springer
14 years 3 months ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
IH
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that t...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
FMCAD
2006
Springer
14 years 1 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
AIPS
2007
14 years 11 days ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...