Results 201 to 210 of about 236,153 (262)
NF-MORL: a neuro-fuzzy multi-objective reinforcement learning framework for task scheduling in fog computing environments. [PDF]
Sci RepYu X +6 more
europepmc +1 more source
Comparative evaluation and simulation of blockchain consensus mechanisms for secure and scalable peer to peer energy trading in microgrids. [PDF]
Sci RepBhavana GB +5 more
europepmc +1 more source
Enhancing the Reliability of AD936x-Based SDRs for Aerospace Applications via Active Register Scrubbing and Autonomous Fault Recovery. [PDF]
Sensors (Basel)Wang J, Wang Z, Zhou L.
europepmc +1 more source
Hybrid GA-PSO Optimization for Controller Placement in Large-Scale Smart City IoT Networks. [PDF]
Sensors (Basel)Memon SA +11 more
europepmc +1 more source
Average distance between the processors of biswapped networks. [PDF]
Sci RepPrabhu S +3 more
europepmc +1 more source
Low power and high-speed quadrate node upset tolerant latch design using CNTFET. [PDF]
Sci RepAsiya S, S SK.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology, 2012
In the clustered environment we have large number of independent components cooperating or collaborating on a computation. Any of this vast number of components can fail at any time, resulting in erroneous output. There are many techniques have been developed to resilience to these kinds of faults.
Rob Walters, Grant Fritchey
+5 more sources
In the clustered environment we have large number of independent components cooperating or collaborating on a computation. Any of this vast number of components can fail at any time, resulting in erroneous output. There are many techniques have been developed to resilience to these kinds of faults.
Rob Walters, Grant Fritchey
+5 more sources
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 1994
Summary: We study fault-tolerant multiprocessor scheduling under the realistic assumption that the occurrence of faults cannot be predicted. The goal in these problems is to minimize the delay incurred by the jobs. Since this is an online problem we use competitive analysis to evaluate possible algorithms.
Kalyanasundaram, Bala, Pruhs, Kirk R.
openaire +1 more source
Summary: We study fault-tolerant multiprocessor scheduling under the realistic assumption that the occurrence of faults cannot be predicted. The goal in these problems is to minimize the delay incurred by the jobs. Since this is an online problem we use competitive analysis to evaluate possible algorithms.
Kalyanasundaram, Bala, Pruhs, Kirk R.
openaire +1 more source