Sciweavers

441 search results - page 57 / 89
» A Method for Proving Observational Equivalence
Sort
View
IH
2004
Springer
14 years 2 months ago
Information Hiding in Finite State Machine
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...
Lin Yuan, Gang Qu
ATAL
2007
Springer
14 years 26 days ago
Modeling plan coordination in multiagent decision processes
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
Ping Xuan
AAAI
2007
13 years 11 months ago
Improved State Estimation in Multiagent Settings with Continuous or Large Discrete State Spaces
State estimation in multiagent settings involves updating an agent’s belief over the physical states and the space of other agents’ models. Performance of the previous approac...
Prashant Doshi
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 10 months ago
Reachability analysis for a class of Petri nets
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
Yu Ru, Christoforos N. Hadjicostis