In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
The discovery of meaningful change points, finding segments, in both categorical and real-value data time series is a well-studied problem. Prior segmentation algorithms and task...
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
Methods like DBSCAN are widely used in the analysis of spatial data. These methods are based on the neighborhood relations which use distance between points. However, these neighb...
— Two coupled logistic maps whose parameters are forced into periodic varying are investigated. From the investigation of bifurcation in this system, nonexistence of odd periodic...