1529 search results - page 219 / 306 » Energy-Based Models of P Systems |
126
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
163
click to vote
ISSRE
2002
IEEE
15 years 9 months ago
2002
IEEE
An important aspect of developing models relating the number and type of faults in a software system to a set of structural measurement is defining what constitutes a fault. By de...
140
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
142
click to vote
RTAS
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we study the problem of allocating end-toend bandwidth to each of multiple traffic flows in a largescale network. We adopt the QoS-based Resource Allocation Model...
120
click to vote
OTM
2005
Springer
15 years 10 months ago
2005
Springer
Peer-to-peer (P2P) networks have proved to be a powerful and highly scalable alternative to traditional client-server architectures for content distribution. They offer the techni...