of it suffer from a number of limitations, including: The effectiveness of an analogical reasoner depends upon its ability to select a relevant analogical source. In many problem d...
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
This paper present a class of investment problem, in which many items could be chosen in a group decision environment. Usually there is a decision table from the board of director...
Domain-partition (DP) model is a general model for reliability maximization problem under given redundancy. In this paper, an improved DP model is used to formulate a reconfigurati...
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...