Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Capacitated Arc Routing Problem (CARP) is known as an NP-hard combinatorial optimization problem. Chemical Reaction Optimization (CRO) is a recent metaheuristic inspired by the nature of chemical reactions of molecules and the mechanism of energy redistribution. CRO has been successfully exploited for solving a broad family of continuous and discrete optimization problems. In this paper, we propose...
Three-dimensional stacked memory is considered to be one of the innovative elements for the next-generation computing system, for it provides high bandwidth and energy efficiency. Particularly, packet routing ability of Hybrid Memory Cubes (HMCs) enables new interconnects for the memories, giving flexibility to its topological design space. Since memory-processor communication is latency-sensitive,...
Three-dimensional stacked memory is considered to be one of the innovative elements for the next-generation computing system, for it provides high bandwidth and energy efficiency. Particularly, packet routing ability of Hybrid Memory Cubes (HMCs) enables new interconnects for the memories, giving flexibility to its topological design space. Since memory-processor communication is latency-sensitive,...
Multi-NoC (multiple network-on-chip) has demonstrated its advantages in power gating for reducing leakage power. This work presents Chameleon, a novel heterogeneous Multi-NoC design. Chameleon employs a fine-grained power gating algorithm which exploits power saving opportunities at different levels of granularity simultaneously. Integrated with a performance-aware traffic allocation policy, Chameleon...
With the rapid development of software defined networking and network function virtualization, researchers have proposed a new cloud networking model called Network-as-a-Service (NaaS) which enables both in-network packet processing and application-specific network control. In this paper, we revisit the problem of achieving network energy efficiency in data centers and identify some new optimization...
Swarm-inspired algorithms allow the creation of complex systems that are scalable in many dimensions, adaptable to changing conditions, and robust against failure. These properties make them suitable for the challenges inherent in distributed storage systems. However, these swarm-based approaches reach their impressive performance by trading away correctness guarantees, occasionally leading to misplaced...
OSPF is one of the routing protocols which is the most widely used in internet and intranet today. The link-state algorithm in OSPF is based on the thought of local optimization, but in certain cases, routing algorithms based on local optimization might lead to a disadvantage which will remarkably depress global performances. A self-adaptive method based on the genetic algorithm is proposed, which...
This paper is talking about Open Capacitated Arc Routing Problem,which is a combinational optimization problem.The objective is mainly to search for a solution of minimum cost.
Delay Tolerant Networks are with intermittent connectivity, high latency and without end-to-end paths from the source to the destination. Message delivering in these networks is characterized by store-and-forward. So the sequence of message delivering and discarding is important to the performance of routing algorithms. However, there is little effort concentrating on buffer management optimization,...
In this paper we present implementation and analysis of the novel routing protocol - the two-phase load balanced shortest path routing (LB-SPR). This routing scheme represents the modification of the existing OSPF protocol, and can be optimized to achieve the maximum guaranteed node traffic. Also, the proposed scheme allows the simple and straightforward process of bandwidth reservation, important...
The location-routing problem is one of the problems in distribution network designing and logistic management, whose mathematical model is proposed in this paper firstly. Since finding the optimal solution for this model is an NP(non-polynomial)problem, we divide the original problem into two sub-problems, i.e., one is the location-allocation problem and the other is general vehicle routing problem...
This paper presents a new key predistribution scheme for sensor networks based on structured graphs. Structured graphs are advantageous in that they can be optimized to minimize the parameter of interest. We discuss various parameters affecting such a scheme.
MACS-DVRPTW, an Ant Colony Optimization based approach useful to solve dynamic vehicle routing problems with time windows, is presented. MACS-DVRPTW is organized with a hierarchy of artificial ant colonies designed to successively optimize a multiple objective function: the first colony minimizes the number of vehicles while the second colony minimizes the traveled distances. Cooperation between colonies...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
Image retrieval over a network is the focus of this paper, as being a major challenge of content based image retrieval. We present a system that gathers feedbacks given by the users in order to learn the location of the searched images. As a result, the active learning of a content based relevance function is enhanced by the selection of hosts containing relevant examples. We achieve a long term merging...
In this article, we propose a general-purpose disaster support system based on generalized (multiplicatively-weighted order-k Minkowski-metric) Voronoi diagrams. The proposed system is capable of handling disasters (or emergency units) having different weights in the complete order from 1 to k in the three popular Minkowski metrics (Euclidean, Manhattan and Maximum distance space). The proposed model...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
In this paper, we introduce a pricing model that ensures efficient resource allocation that provides guaranteed quality of service while maximizing profit in multiservice networks. Specifically, a dynamic allocation policy is examined that relies on online measurements while each service class operates under a probabilistic bound delay constraint. We present a rigorous analysis of the properties of...
This paper explores the attributes, layering models and objective functions in cross layer designs for mobile ad hoc wireless networks by taking all the statistical characteristics and constraints from the physical (PHY) layer, media access control (MAC) layer and network (NET) layer into consideration. This paper reviews the entire network optimization across all the PHY/MAC/NET layers. At the PHY...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.