Sciweavers

817 search results - page 46 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
ICPR
2008
IEEE
15 years 9 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
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 ...
Alexander Kolesnikov
CCCG
2010
15 years 4 months ago
k-star-shaped polygons
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 ...
Jeff Sember, William Evans
120
Voted
REX
1991
15 years 7 months ago
The Theory of Timed Automata
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...
Rajeev Alur, David L. Dill
140
Voted
GIS
2007
ACM
15 years 7 months ago
Optimal traversal planning in road networks with navigational constraints
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...
106
Voted
CEC
2005
IEEE
15 years 9 months ago
A new representation in evolutionary algorithms for the optimization of bioprocesses
AbstractEvolutionary Algorithms (EAs) have been used to achieve optimal feedforward control in a number of fedbatch fermentation processes. Typically, the optimization purpose is t...
Miguel Rocha, Isabel Rocha, Eugénio C. Ferr...