5863 search results - page 739 / 1173 » On Model-Checking of P Systems |
168
click to vote
SPAA
2009
ACM
16 years 7 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...
188
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
171
click to vote
RTSS
1999
IEEE
15 years 11 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
173
click to vote
OPODIS
2008
15 years 8 months ago
2008
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
191
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
In the task of adaptive information filtering, a system receives a stream of documents but delivers only those that match a person's information need. As the system filters i...