Sciweavers

504 search results - page 29 / 101
» Complexity Properties of Restricted Abstract Argument System...
Sort
View
69
Voted
ATAL
2010
Springer
14 years 10 months ago
Opportunistic belief reconciliation during distributed interactions
Successful interaction between autonomous agents is contingent on those agents making decisions consistent with the expectations of their peers -- these expectations are based on ...
Paul Martin, David Robertson, Michael Rovatsos
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
15 years 2 months ago
Receding horizon temporal logic planning for dynamical systems
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...
Tichakorn Wongpiromsarn, Ufuk Topcu, R. Richard Mu...
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
15 years 2 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
DATE
2006
IEEE
117views Hardware» more  DATE 2006»
15 years 3 months ago
Formal verification of systemc designs using a petri-net based representation
This paper presents an effective approach to formally verify SystemC designs. The approach translates SystemC models into a Petri-Net based representation. The Petri-net model is ...
Daniel Karlsson, Petru Eles, Zebo Peng