Sciweavers

736 search results - page 36 / 148
» Approximating the Number of Network Motifs
Sort
View
SACMAT
2006
ACM
15 years 3 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
ATAL
2008
Springer
14 years 12 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
SARA
2005
Springer
15 years 3 months ago
Approximate Model-Based Diagnosis Using Preference-Based Compilation
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
Gregory M. Provan
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
14 years 9 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
MOBIHOC
2010
ACM
14 years 7 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan