: This paper reports research concerning issues involved in adopting a computational dialectics approach to develop a human-computer debating system for educational debate. In part...
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
Masri Ayob, Ariff Md. Ab. Malik, Salwani Abdullah,...
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...