Sciweavers

1662 search results - page 226 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
GAMESEC
2010
136views Game Theory» more  GAMESEC 2010»
13 years 6 months ago
Effective Multimodel Anomaly Detection Using Cooperative Negotiation
Abstract. Many computer protection tools incorporate learning techniques that build mathematical models to capture the characteristics of system's activity and then check whet...
Alberto Volpatto, Federico Maggi, Stefano Zanero
NICSO
2010
Springer
14 years 3 months ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto
AUTOMATICA
2010
110views more  AUTOMATICA 2010»
13 years 9 months ago
Moving-horizon partition-based state estimation of large-scale systems
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-over...
Marcello Farina, Giancarlo Ferrari-Trecate, Riccar...
IJISEC
2006
108views more  IJISEC 2006»
13 years 8 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
JPDC
2008
103views more  JPDC 2008»
13 years 8 months ago
On termination detection in crash-prone distributed systems with failure detectors
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
Neeraj Mittal, Felix C. Freiling, Subbarayan Venka...