1686 search results - page 157 / 338 » Programs as polygraphs: computability and complexity |
152
Voted
EUROSYS
2010
ACM
15 years 9 months ago
2010
ACM
The mainstream adoption of cluster, grid, and most recently cloud computing models have broadened the applicability of parallel programming from scientific communities to
the bus...
138
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
133
Voted
EUC
2008
Springer
15 years 5 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
126
Voted
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
128
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Autonomic computing has been proposed recently as a way to address the difficult management of applications whose complexity is constantly increasing. Autonomous applications will ...