Sciweavers

12453 search results - page 38 / 2491
» Concurrent Data Structures
Sort
View
IPPS
1998
IEEE
15 years 9 months ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas
LICS
2005
IEEE
15 years 10 months ago
Relations in Concurrency
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisa...
Glynn Winskel
134
Voted
SEFM
2005
IEEE
15 years 10 months ago
Safe Concurrency for Aggregate Objects with Invariants
Developing safe multithreaded software systems is difficult due to the potential unwanted interference among concurrent threads. This paper presents a flexible methodology for o...
Bart Jacobs 0002, Frank Piessens, K. Rustan M. Lei...
IANDC
2006
81views more  IANDC 2006»
15 years 4 months ago
True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
This paper is devoted to probabilistic models for concurrent systems under their true-concurrency semantics. Here we address probabilistic event structures. We consider a new clas...
Samy Abbes, Albert Benveniste
NAACL
1994
15 years 6 months ago
Semantic Evaluation for Spoken-Language Systems
Development has begun on a semantic evaluation (SemEval) methodology and infrastructure for the ARPA Spoken Language Program. SemEval is an attempt to define a task-independent te...
Robert C. Moore