17541 search results - page 154 / 3509 » Complexity in scalable computing |
147
click to vote
HPCN
2000
Springer
15 years 7 months ago
2000
Springer
The paper presents the implementation of a railway control system, as a means of assessing the potential of coordination languages to be used for modelling software architectures f...
116
click to vote
ICPADS
1998
IEEE
15 years 7 months ago
1998
IEEE
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
116
Voted
AAAI
2007
15 years 5 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
129
click to vote
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...
109
click to vote
IPM
2006
15 years 3 months ago
2006
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...