We introduce an adaptive generalized selection combining (A-GSC) receiver that can be efficiently applied in diversity rich fading environments such as in ultra-wideband applicatio...
Athanasios S. Lioumpas, George K. Karagiannidis, T...
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
—We examine the applicability of existing IP multicast mechanisms for Point-to-Point links such as wired and wireless telephone lines. We identify problems such as overhead due t...
Subbisimilarity is proposed as a general tool to classify the relative expressive power of process calculi. The expressiveness of several variants of CCS is compared in terms of t...
—This paper presents the results of an empirical study of wireless propagation channels for vehicle-to-vehicle communications in street intersections, a scenario especially impor...
Johan Karedal, Fredrik Tufvesson, T. Abbas, Oliver...