Learn More
We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of n points in the plane in a given order. This problem is a sub-problem of the Dubins Traveling Salesman Problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that(More)
Increasing energy consumption in server consolidation environments leads to high maintenance costs for data centers. Main memory, no less than processor, is a major energy consumer in this environment. This paper proposes a technique for reducing memory energy consumption using virtual machine scheduling in multicore systems. We devise several heuristic(More)
During mitosis, establishment of structurally and functionally sound bipolar spindles is necessary for maintaining the fidelity of chromosome segregation. Tumor-associated microtubule-associated protein (TMAP), also known as cytoskeleton-associated protein 2 (CKAP2), is a mitotic spindle-associated protein whose level is frequently up-regulated in various(More)
A graph drawn in the plane with $$n$$ n vertices is $$k$$ k -fan-crossing free for $$k \geqslant 2$$ k ⩾ 2 if there are no $$k+1$$ k + 1 edges $$g,e_1,\ldots , e_k$$ g , e 1 , … , e k , such that $$e_1,e_2,\ldots ,e_k$$ e 1 , e 2 , … , e k have a common endpoint and $$g$$ g crosses all  $$e_i$$ e i . We prove a tight bound of $$4n-8$$ 4 n - 8 on the maximum(More)
We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations σ, σ′, let `(σ, σ′) be the shortest bounded-curvature path from σ to σ′. For d > 0, let `(d) be the supremum of `(σ, σ′), over all pairs (σ, σ′) that(More)
Increasing energy consumption in server consolidation environments leads to high maintenance costs for data centers. Main memory, no less than processor, is a major energy consumer in this environment. This paper proposes a problem of reducing memory energy consumption using virtual machine scheduling in multi-core systems. We prove that scheduling virtual(More)
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m logm) time a data structure that uses O(m) space and allows to answer the following query in O(logm) time: Given a parabola γ : y = ax+bx+c, does γ separate A and B? This structure can be used to build a data structure that stores a simple polygon and(More)