208 search results - page 39 / 42 » Highly dependable concurrent programming using design for ve... |
125
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
105
Voted
ASPLOS
1992
ACM
15 years 4 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
105
click to vote
IWMM
2009
Springer
15 years 7 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
105
click to vote
ASPLOS
1994
ACM
15 years 4 months ago
1994
ACM
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...
113
click to vote
TLDI
2009
ACM
15 years 9 months ago
2009
ACM
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...