Sciweavers

1923 search results - page 263 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
PODC
2005
ACM
15 years 3 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
MIDDLEWARE
2005
Springer
15 years 3 months ago
Sensor bean: a component platform for sensor-based services
Sensor-based services propose to gather, manage, analyze, access and react to sensor data. These services are distributed over heterogeneous platforms. The complexity of the imple...
Cristina Marin, Mikael Desertot
OOPSLA
2010
Springer
14 years 8 months ago
An input-centric paradigm for program dynamic optimizations
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
Kai Tian, Yunlian Jiang, Eddy Z. Zhang, Xipeng She...
OOPSLA
2010
Springer
14 years 8 months ago
Cross-language, type-safe, and transparent object sharing for co-located managed runtimes
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
Michal Wegiel, Chandra Krintz
ESORICS
2007
Springer
15 years 1 months ago
Satisfiability and Resiliency in Workflow Systems
We propose the role-and-relation-based access control (R2 BAC) model for workflow systems. In R2 BAC, in addition to a user's role memberships, the user's relationships w...
Qihua Wang, Ninghui Li