For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
Generative parallel design patterns is a proven technique to improve the productivity of parallel program development. However many of the generative design-pattern systems are de...
We would like to introduce the web tutor ORGANON, which aims to support basic logic courses at the University of West Bohemia in Pilsen (Czech Republic). The application was desig...