11016 search results - page 569 / 2204 » Cloud Computing for Science |
165
click to vote
IFIPTCS
2010
15 years 5 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
180
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
173
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
236
click to vote
CSE
2008
IEEE
16 years 1 months ago
2008
IEEE
Methods of Computational Fluid Dynamics are applied to simulate pulsatile blood flow in human vessels and in the aortic arch. The non-Newtonian behaviour of the human blood is in...
186
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...