A subspace-based blind adaptive linear minimum mean square error (MMSE) detector has been proposed for multi-user detection in a direct sequence code-division multiple-access (CDMA) system even when multi-path channels are unknown. In this paper, the applicability of the subspace-based blind adaptive algorithm in multiple access ultra-wideband (UWB) systems is investigated. The problem of blind...

A mobile ad hoc network (MANET) is one composed of a set of mobile hosts capable of communicating with each other without the assistance of base stations. This paper considers the QoS (quality-ofservice) routing problem in a MANET, which is important for many real-time multimedia applications. We propose an on-demand protocol for searching for a multi-path QoS route from a source host to a dest...

Ambient computing requires the integration of multiple mobile heterogeneous networks. Multi-path communication in such scenarios can provide reliability and privacy benefits. Even though the properties of multi-path routing have been extensively studied and a number of algorithms proposed, implementation of such techniques can be tricky, particularly when resource-constrained nodes are connecte...

An ad hoc network is a collection of mobile nodes connected through multi-hop wireless links without the required intervention of any centralized access point or existing infrastructure. In this work, we have developed an analytical framework for computing the reliabilities of multi-hop paths. We have also investigated the effect of multi-path characteristics on path reliabilities. Among the ma...

To effectively optimize multi-objective logistics distribution path, the distance and distance related customer satisfaction factor are used as the objective function, a novel kruskal crossover genetic algorithm (KCGA) for multi-objective logistics distribution path optimization is proposed. To test the optimization results, the terminal distribution model and the virtual logistics system opera...

Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domai...

Much of the literature on multi-agent path finding focuses on undirected graphs, where motion is permitted in both directions along a graph edge. Despite this, travelling on directed graphs is relevant in navigation domains, such as pathfinding in games, and asymmetric communication networks. We consider multi-agent path finding on strongly biconnected directed graphs. We show that all instance...

This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...

Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...