1923 search results - page 203 / 385 » Modeling Complexity in Secure Distributed Computing |
SEKE
2004
Springer
15 years 3 months ago
2004
Springer
As application semantics becomes more complex and dynamic in IT systems, it is necessary to engineer the application semantics in its own lifecycle of development parallel to syste...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
IMC
2010
ACM
14 years 8 months ago
2010
ACM
Previous methods of network anomaly detection have focused on defining a temporal model of what is "normal," and flagging the "abnormal" activity that does not...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
AGENTS
2000
Springer
15 years 2 months ago
2000
Springer
This paper extends earlier work in the use of ‘Agent-based Computational Economics’ (ACE) for modelling the development of co-operation between firms. Inter-firm relations hav...