This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...
Xuezheng Liu, Guangwen Yang, Ming Chen, Yongwei Wu
This paper introduces a new visual representation of a document or group of documents, a Dynamic Document Icon, or Dydocon. Its representation is symbolic like an icon, but change...