: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become ve...
Jing-Ru Zhang, Jun Zhang, Tat-Ming Lok, Michael R....
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...