In the group Steiner problem we are given an edge-weighted graph G = (V, E, w) and in subsets of vertices {g(i)}(i=1)(m).
A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization problems.
This chapter presents efficient techniques for monitoring link and path delays in a Service Provider or Enterprise IP network.
With the reuse of identical training sequences by users in different cells, massive MIMO is severely affected by pilot contamination due to residual error in channel estimation.
By using totally isotropic subspaces in an orthogonal space Omega(+)(2i, 2), several infinite families of packings of 2(k) -dimensional subspaces of real 2(i) -dimensional space are constructed, so
This memorandum focuses on the generic problem of designing a large NxN (N > 1000) high-performance, broadband packet (or ATM) switch.
This conversion signal processor (CSP) handles all classes of EGPRS (classes 1 to 29) and is fabricated in a 0.30μm, 3V CMOS process.
If our long-sought quest to create autonomous anthropomorphic automata is to succeed, we must first impart human perceptual capabilities to machines.
N 1931 Davisson and Calbick showed 1 that a circular aperture in a conducting plate which separates regions with different electric gradients normal to the surfaces acts as an electron lens of foca
We demonstrate a half wave plate whose principle of operation is based on the strong evanescent field coupling between two metal layers with arrays of subwavelength slits.
