Jichiang Tsai
National Chung Hsing University
42 Papers
141 Citations
Jichiang Tsai is an academic researcher from National Chung Hsing University. The author has contributed to research in topics: Search engine indexing & Consensus. The author has an hindex of 8, co-authored 38 publications. Previous affiliations of Jichiang Tsai include National Taiwan University.
Chat about Author
Papers
Delay and Energy Tradeoff in Energy Harvesting Multi-Hop Wireless Networks With Inter-Session Network Coding and Successive Interference Cancellation
TL;DR: A cross-layer formulation for a joint routing, network coding, and scheduling problem in a wireless energy transfer network to make the length-energy tradeoff while satisfying the traffic demands from the upper layer is presented.
21
Fault Tolerance for Super-Peers of P2P Systems
Jenn-Wei Lin,Ming-Feng Yang,Jichiang Tsai +2 more
- 17 Dec 2007
TL;DR: This paper presents an efficient fault-tolerant approach for the super-peers of peer-to-peer (P2P) file sharing systems by proposing a multiple publication technique to make each regular peer logically connect with two or more super peers in other groups.
Accuracy Improvement of Autonomous Straight Take-off, Flying Forward, and Landing of a Drone with Deep Reinforcement Learning
TL;DR: Department of Information Engineering and Computer Science, Feng Chia University, No. 100, Wenhua Rd., Xitun Dist., Taichung City 407, Taiwan (R.O.C.)
18
An efficient index-based checkpointing protocol with constant-size control information on messages
TL;DR: This paper proposes an efficient index-based CIC protocol, called NMMP, which is almost as efficient as FI in some typical computational environments and demonstrates that the two protocols have the same behavior over a tree communication network.
15
On properties of RDT communication-induced checkpointing protocols
TL;DR: It is proved that if an online RDT protocol encounters a U-path at a point of a checkpoint and communication pattern associated with a distributed computation, it also encounters a V-path there, and it can be concluded that breaking all invisibly doubled U- paths is equivalent to breaking all invisible doubled V- paths for an onlineRDT protocol.
13