Search results for "routing"
showing 10 items of 587 documents
A Novel Approach to Introducing Adaptive Filters Based on the LMS Algorithm and Its Variants
2004
This paper presents a new approach to introducing adaptive filters based on the least-mean-square (LMS) algorithm and its variants in an undergraduate course on digital signal processing. Unlike other filters currently taught to undergraduate students, these filters are nonlinear and time variant. This proposal introduces adaptive filtering in the context of a linear time-invariant system using a real problem. In this way, introducing adaptive filters using concepts already familiar to the students motivates their interest through practical application. The key point for this simplification is that the input to the filter is constant so that the adaptive filter becomes linear. Therefore, a …
A value for multichoice games
2000
Abstract A multichoice game is a generalization of a cooperative TU game in which each player has several activity levels. We study the solution for these games proposed by Van Den Nouweland et al. (1995) [Van Den Nouweland, A., Potters, J., Tijs, S., Zarzuelo, J.M., 1995. Cores and related solution concepts for multi-choice games. ZOR-Mathematical Methods of Operations Research 41, 289–311]. We show that this solution applied to the discrete cost sharing model coincides with the Aumann-Shapley method proposed by Moulin (1995) [Moulin, H., 1995. On additive methods to share joint costs. The Japanese Economic Review 46, 303–332]. Also, we show that the Aumann-Shapley value for continuum game…
Preliminary research on conversion of encapsulated somatic embryos of Citrus reticulata Blanco, cv. Mandardino Tardivo di Ciaculli.
2006
Somatic embryogenesis was obtained through anther culture of Citrus reticulata, cv. Mandarino Tardivo di Ciaculli. The work was carried out to evaluate the response of somatic embryos inside a sodium alginate coating to different storage periods, and to the effects of the germicide PPM (1 ml l(-1) stop) and the fungicide Thiophanate-methyl (100 mg l(-1) stop). The effect of these alone or in combination, added to the artificial endosperm on the performance of the encapsulated somatic embryos was tested. After 45 days of culturing, sprouting, root development and conversion were recorded. The encapsulated somatic embryos can be conveniently stored at 4 degrees C, but not for a period longer …
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
2021
Abstract The soft-clustered vehicle-routing problem is a variant of the classical capacitated vehicle-routing problem (CVRP) in which customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. We introduce a novel symmetric formulation of the problem in which the clustering part is modeled with an asymmetric sub-model. We solve the new model with a branch-and-cut algorithm exploiting some known valid inequalities for the CVRP that can be adapted. In addition, we derive problem-specific cutting planes and new heuristic and exact separation procedures. For square grid instances in the Euclidean plane, we provide lower-bounding techniques …
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
2013
This article studies the vehicle routing problem with trailers and transshipments VRPTT, a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: i Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. ii Based on these formulations, five different branch-and-cut algorithms are developed and implemented. iii The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 631, 119-133 20…
A service-oriented routing scheme with load balancing in wireless mesh networks
2008
Wireless mesh networks will play an important role in the next-generation wireless communication systems as it can provide wide coverage and scalable broadband Internet access services. However, congestion in such networks may lead to throughput degradation, packet loss and longer transmission delay. Therefore, routing and traffic forwarding schemes which are aware of the congestion status of a wireless network can efficiently improve network performance. In this paper, we propose a new congestion-aware routing scheme which may direct different paths for different services types, according to network congestion status. The goal of this routing scheme is to use traffic load metric for choosi…
An Efficient Implementation of Distributed Routing Algorithms for NoCs
2008
The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (logic-based distributed routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most …
Applications of the vehicle routing problem with trailers and transshipments
2013
Abstract The vehicle routing problem with trailers and transshipments (VRPTT) is a recent and challenging extension of the well-known vehicle routing problem. The VRPTT constitutes an archetypal representative of the class of vehicle routing problems with multiple synchronization constraints (VRPMSs). In addition to the usual task covering constraints, VRPMSs require further synchronization between vehicles, concerning spatial, temporal, and load aspects. VRPMSs possess considerable practical relevance, but limited coverage in the scientific literature. The purpose of the present paper is to describe how several important types of VRPMSs, such as multi-echelon location-routing problems and …
Circuit-Elimination based Link-State Routing in Mobile Ad-hoc Networks
2007
Circuit-elimination based connected dominating set formation is an efficient technique for reducing routing overhead in mobile ad hoc networks. In this paper, we propose a new message dissemination algorithm which utilizes such techniques to reduce the number of nodes that generate or forward link state advertisements in link state routing protocols. Simulation results with both static and dynamic network topologies demonstrate the potential of the proposed algorithm to reduce routing overhead, compared with a benchmark link state routing protocol, OLSR.
Mean square rate of convergence for random walk approximation of forward-backward SDEs
2020
AbstractLet (Y,Z) denote the solution to a forward-backward stochastic differential equation (FBSDE). If one constructs a random walk$B^n$from the underlying Brownian motionBby Skorokhod embedding, one can show$L_2$-convergence of the corresponding solutions$(Y^n,Z^n)$to$(Y, Z).$We estimate the rate of convergence based on smoothness properties, especially for a terminal condition function in$C^{2,\alpha}$. The proof relies on an approximative representation of$Z^n$and uses the concept of discretized Malliavin calculus. Moreover, we use growth and smoothness properties of the partial differential equation associated to the FBSDE, as well as of the finite difference equations associated to t…