Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Clock mesh networks are well known for their variation tolerance. But their usage is limited to high-end designs due to the significantly high resource requirements compared to clo...
Service availability is one of the most closely scrutinized metrics in offering network services. It is important to cost-effectively provision a managed and differentiated networ...
Dahai Xu, Ying Li, Mung Chiang, A. Robert Calderba...
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...