Sciweavers

202 search results - page 38 / 41
» Composing and decomposing systems under security properties
Sort
View
AAAI
1994
13 years 10 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
NDSS
2007
IEEE
14 years 2 months ago
Attribute-Based Publishing with Hidden Credentials and Hidden Policies
With Hidden Credentials Alice can send policyencrypted data to Bob in such a way that he can decrypt the data only with the right combination of credentials. Alice gains no knowle...
Apu Kapadia, Patrick P. Tsang, Sean W. Smith
NETGAMES
2006
ACM
14 years 2 months ago
Network game design: hints and implications of player interaction
While psychologists analyze network game-playing behavior in terms of players’ social interaction and experience, understanding user behavior is equally important to network res...
Kuan-Ta Chen, Chin-Laung Lei
TBILLC
2005
Springer
14 years 2 months ago
Case Attraction in Ancient Greek
Case attraction has stood as a puzzling, and elusive, oddity of older Indo-European languages. This paper focuses on attraction in Ancient Greek, establishing both the regularity o...
Scott Grimm
CMSB
2006
Springer
14 years 8 days ago
Probabilistic Model Checking of Complex Biological Pathways
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
John Heath, Marta Z. Kwiatkowska, Gethin Norman, D...