Results 201 to 210 of about 15,383 (260)

State Migration in Styx: Towards Serverless Transactional Functions. [PDF]

VLDB J
Psarakis K, Christodoulou G, Siachamis G, Fragkoulis M, Katsifodimos A.   +4 more
europepmc   +1 more source

Auditory–Tactile Congruence for Synthesis of Adaptive Pain Expressions in RoboPatients

Advanced Robotics Research, EarlyView.
In this work, we explore auditory–tactile congruence for synthesizing adaptive vocal pain expressions in robopatients. Using a robopatient platform that integrates vocal pain sounds with palpation forces, we conducted 7680 trials across 20 participants.
Saitarun Nadipineni, Chapa Sirithunge, Yue Xie, Fumiya Iida, Thilina Dulantha Lalitharatne   +4 more
wiley   +1 more source

A blockchain-enabled framework for secure and efficient data transmission in underwater sensor networks using advanced cryptographic techniques. [PDF]

Sci Rep
Kumar KK, Pavani M, Chandra NS, Chitralingappa P, Kumar BH, Anushree G.   +5 more
europepmc   +1 more source

Thermodynamic Limits of Fault-Tolerant Quantum Computing Beyond the Weak-Coupling, Quasistatic Regime. [PDF]

Entropy (Basel)
Guha Majumdar M.
europepmc   +1 more source

Continuous-variable fault-tolerant quantum computation under general noise. [PDF]

Nat Commun
Matsuura T, Menicucci NC, Yamasaki H.
europepmc   +1 more source

Novel single stage multipath 8 × 8 interconnection network/switching element (SSMIN/E) architecture. [PDF]

Sci Rep
Gupta S, Bala M, Jondhale SR, Jondhale AS, Sharma G.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fault-tolerant scheduling

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.
Bala Kalyanasundaram, Kirk Pruhs
openaire   +1 more source

Designing masking fault-tolerance via nonmasking fault-tolerance

IEEE Transactions on Software Engineering, 1998
Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guarantee as much: it merely guarantees that when faults stop occurring, program executions converge to states from where programs continually (re)satisfy their specification.
Anish Arora, Sandeep S. Kulkarni
openaire   +1 more source