4586 search results - page 411 / 918 » Computing stable models in parallel |
123
click to vote
SPAA
1990
ACM
15 years 9 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
133
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
176
click to vote
EDOC
2009
IEEE
15 years 9 months ago
2009
IEEE
A key challenge in devising solutions to a range of problems associated with business process management: process life cycle management, compliance management, enterprise process ...
193
click to vote
COLCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract. Mashups are defined to be lightweight Web applications aggregating data from different Web services, built using ad-hoc composition and being not concerned with long term...
125
Voted
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...