We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we fully characterize the degeneracy of random intersection graphs, and prove that the model asymptotically almost surely produces graphs with hyperbolicity at ...

In this paper we present a novel algorithm for identifying linear time-invariant discrete time state-space models from frequency response data. The algorithm is non-iterative and exactly recovers a true system of order n, if n + 2 noise-free uniformly spaced frequency response measurements are given. Analysis show that if the measurements are perturbed with errors upper bounded by the identiica...

In our recent research we studied a feasibility problem with infinitely many sets in metric space, presented novel algorithm and analyzed its convergence. the present paper study introduced that work for common fixed taking into account computational errors. We show generates good approximate solution, if errors are bounded from above by small positive constant.

Grover’s algorithm is a quantum search algorithm solving the unstructured search problem of size n in O( √ n) queries, while any classical algorithm needs O(n) queries [3]. However, if query has some small probability of failing (reporting that none of the elements are marked), then quantum speed-up disappears: no quantum algorithm can be faster than a classical exhaustive search by more than a...

| this paper presents the rst path planner taking into account both non-holonomic and uncertainty constraints. The case of a car-like robot subject to cumulative and unbounded connguration uncertainty related to bounded control and sensing errors is considered. Assuming the existence of landmarks allowing the robot to relocalize itself in particular places, we present an algorithm that computes...