4940 search results - page 195 / 988 » On the Complexity of Universal Programs |
214
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a two-layered approach for exploiting different forms of concurrency in complex systems: We specify computational components in our functional array language SaC, whic...
182
Voted
GRID
2004
Springer
16 years 12 days ago
2004
Springer
Allowing loose coupling between complex e-Science applications has many advantages, such as being able to easily incorporate new applications and to flexibly specify how the appl...
193
Voted
TCBB
2010
15 years 5 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
237
Voted
TGC
2010
Springer
15 years 4 months ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
198
Voted
ISESE
2005
IEEE
16 years 19 days ago
2005
IEEE
We studied the effects of pair programming in a team context on productivity, defects, design quality, knowledge transfer and enjoyment of work. Randomly formed three pair program...