822 search results - page 95 / 165 » Contention in shared memory algorithms |
148
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
Focused Web browsing activities such as periodically looking up headline news, weather reports, etc., which require only selective fragments of particular Web pages, can be made m...
104
Voted
SPAA
1990
ACM
15 years 6 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...
127
Voted
JACM
2002
15 years 2 months ago
2002
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
135
Voted
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Visitors enter a website through a variety of means, including web searches, links from other sites, and personal bookmarks. In some cases the first page loaded satisfies the visi...
100
click to vote
IJAR
2010
14 years 11 months ago
2010
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. Tatman and Shachter (1990), introduced the possibility of having super-valu...