A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
AbstractEvolutionary Algorithms (EAs) have been used to achieve optimal feedforward control in a number of fedbatch fermentation processes. Typically, the optimization purpose is t...