5653 search results - page 199 / 1131 » Distributed Conceptual Structures |
146
click to vote
SPAA
1990
ACM
15 years 10 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...
164
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
152
click to vote
CCGRID
2001
IEEE
15 years 10 months ago
2001
IEEE
To ameliorate the need to spend significant programmer time modifying parallel programs to achieve highperformance, while maintaining compact, comprehensible source codes, this pa...
178
click to vote
IJCAI
2001
15 years 8 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
142
click to vote
ISMB
1997
15 years 7 months ago
1997
The world wide web(WWW)has becomecritical for storing and disseminatingbiological data. It offers an additional opportunity, however,to support distributed computation and sharing...