Sciweavers

1802 search results - page 135 / 361
» Complexity Theory for Operators in Analysis
Sort
View
CSFW
2009
IEEE
15 years 10 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
16 years 16 days ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
SIGECOM
2006
ACM
115views ECommerce» more  SIGECOM 2006»
16 years 10 days ago
Multi-attribute coalitional games
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
Samuel Ieong, Yoav Shoham
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
16 years 26 days ago
Resource pooling for optimal evacuation of a large building
— This paper is concerned with modeling, analysis and optimization/control of occupancy evolution in a large building. The main concern is efficient evacuation of a building in ...
Kun Deng, Wei Chen, Prashant G. Mehta, Sean P. Mey...
LICS
2006
IEEE
16 years 12 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson