—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
- Vulnerabilities related to weak passwords are a pressing global economic and security issue. We report a novel, simple, and effective approach to address the weak password probl...
- In this work we are analyzing scalability of the heuristic algorithm we used in the past [1-4] to discover knowledge from multi-valued symbolic attributes in fuzzy databases. The...
—In a data center network, for example, it is quite often to use controllers to manage resources in a centralized manner. Centralized control, however, imposes a scalability prob...
We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. All our results are in the standard word RA...
Timothy M. Chan, Kasper Green Larsen, Mihai Patras...
—Nowadays, several industrial applications are being ported to parallel architectures. These applications take advantage of the potential parallelism provided by multiple core pr...
We study decision making in environments where the reward is only partially observed, but can be modeled as a function of an action and an observed context. This setting, known as...