A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in coopera...
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Avionics data at the National Aeronautics and Space Administration’s (NASA) Jet Propulsion Laboratory (JPL) consists of distributed, unmanaged, and heterogeneous information tha...