Abstract This paper addresses a real‐world multi‐period orienteering problem arising in large Italian company that needs to patrol an area order provide security services set of customers. Each customer requires different on weekly basis. Some are mandatory, while others optional. It might be impossible perform all optional services, and each them is assigned score when performed. The challenge...

Recent research on imprecise computation (that is, flexible computation) at the University of Illinois has focused on the development of operating system support for imprecise computations. The scheduling algorithms and imprecise-computation environment resulting from this work enable the use of imprecise computation as a means to provide scheduling flexibility in real-time systems and to enhan...

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7]. The notation and terminology used here are int...