Sciweavers

1144 search results - page 227 / 229
» Locally constructed algorithms for distributed computations ...
Sort
View
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
RECOMB
2010
Springer
14 years 2 months ago
Incremental Signaling Pathway Modeling by Data Integration
Constructing quantitative dynamic models of signaling pathways is an important task for computational systems biology. Pathway model construction is often an inherently incremental...
Geoffrey Koh, David Hsu, P. S. Thiagarajan
MIDDLEWARE
2004
Springer
14 years 25 days ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
SACMAT
2006
ACM
14 years 1 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
SIROCCO
2008
13 years 9 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker