Bibliographies thématiques / Network of problem

Littérature scientifique sur le sujet « Network of problem »

Auteur : Grafiati

Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences
Rapports d'organisations

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Network of problem ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Network of problem"

Nasution, Mahyuddin K. M., Rahmad Syah et Marischa Elveny. « Social Network Analysis : Towards Complexity Problem ». Webology 18, n^o 2 (23 décembre 2021) : 449–61. http://dx.doi.org/10.14704/web/v18i2/web18332.

Texte intégral

Résumé :

Social network analysis is a advances from field of social networks. The structuring of social actors, with data models and involving intelligence abstracted in mathematics, and without analysis it will not present the function of social networks. However, graph theory inherits process and computational procedures for social network analysis, and it proves that social network analysis is mathematical and computational dependent on the degree of nodes in the graph or the degree of social actors in social networks. Of course, the process of acquiring social networks bequeathed the same complexity toward the social network analysis, where the approach has used the social network extraction and formulated its consequences in computing.

Styles APA, Harvard, Vancouver, ISO, etc.

Hau, Than Nguyen, Hiroshi Hirai et Nobuyuki Tsuchimura. « ON HALF-INTEGRALITY OF NETWORK SYNTHESIS PROBLEM ». Journal of the Operations Research Society of Japan 57, n^o 2 (2014) : 63–73. http://dx.doi.org/10.15807/jorsj.57.63.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

KAMIMURA, RYOTARO. « MULTI-LAYERED GREEDY NETWORK-GROWING ALGORITHM : EXTENSION OF GREEDY NETWORK-GROWING ALGORITHM TO MULTI-LAYERED NETWORKS ». International Journal of Neural Systems 14, n^o 01 (février 2004) : 9–26. http://dx.doi.org/10.1142/s012906570400184x.

Texte intégral

Résumé :

In this paper, we extend our greedy network-growing algorithm to multi-layered networks. With multi-layered networks, we can solve many complex problems that single-layered networks fail to solve. In addition, the network-growing algorithm is used in conjunction with teacher-directed learning that produces appropriate outputs without computing errors between targets and outputs. Thus, the present algorithm is a very efficient network-growing algorithm. The new algorithm was applied to three problems: the famous vertical-horizontal lines detection problem, a medical data problem and a road classification problem. In all these cases, experimental results confirmed that the method could solve problems that single-layered networks failed to. In addition, information maximization makes it possible to extract salient features in input patterns.

Styles APA, Harvard, Vancouver, ISO, etc.

GU, WEIZHEN, D. FRANK HSU et XINGDE JIA. « ON A NETWORK SENSING PROBLEM ». Journal of Interconnection Networks 07, n^o 01 (mars 2006) : 63–73. http://dx.doi.org/10.1142/s0219265906001582.

Texte intégral

Résumé :

Live traffic flow information can help improve the efficiency of a communication network. There are many ways available to monitor the traffic flow of a network. In this paper, we propose a very efficient monitoring strategy. This strategy not only reduces the number of nodes to be monitored but also determines the complete traffic information of the entire network using the information from the monitored nodes. The strategy is optimal for monitoring a network because it reduces the number of monitored nodes to a minimum. Fast algorithms are also presented in this paper to compute the traffic information for the entire network based on the information collected from the monitored nodes. The monitoring scheme discussed in this paper can be applied to the internet, telecommunication networks, wireless ad hoc networks, large scale multiprocessor computing systems, and other information systems where the transmission of information needs to be monitored.

Styles APA, Harvard, Vancouver, ISO, etc.

GEN, MITSUO, et RUNWEI CHENG. « EVOLUTIONARY NETWORK DESIGN : HYBRID GENETIC ALGORITHMS APPROACH ». International Journal of Computational Intelligence and Applications 03, n^o 04 (décembre 2003) : 357–80. http://dx.doi.org/10.1142/s1469026803001075.

Texte intégral

Résumé :

In recent years we have evidenced an extensive effort in the development of computer communication networks, which have deeply integrated in human being's everyday life. One of the important aspects of the network design process is the topological design problem involved in establishing a communication network. However, with the increase of the problem scale, the conventional techniques are facing the challenge to effectively and efficiently solve those complicated network design problems. In this article, we give a brief survey on our recent research works of network design problems by using genetic algorithms (GAs), such as, multistage process planning problem, fixed charge transportation problem, minimum spanning tree problem, centralized network design, and local area network design, shortest path problem, minimum cost maximum flow problem, and optimal scheduling problems based on network topology. All these problems are illustrated from the point of genetic representation encoding skill and the genetic operators with hybrid strategies. Numerical experiments show the effectiveness and efficiency of such kind of GA-based approach.

Styles APA, Harvard, Vancouver, ISO, etc.

BONG, NOVI H., JOE RYAN et KIKI A. SUGENG. « MaxDDBS Problem on Beneš Network ». Journal of Interconnection Networks 17, n^o 03n04 (septembre 2017) : 1741003. http://dx.doi.org/10.1142/s0219265917410031.

Texte intégral

Résumé :

Maximum degree-diameter bounded subgraph problem is a problem of constructing the largest possible subgraph of given degree and diameter in a graph. This problem can be considered as a degree-diameter problem restricted to certain host graphs. The MaxDDBS problem with Beneš network as the host graph is discussed in this paper. Beneš network contains a back-to-back buttery network. Even though both networks have maximum degree 4, the structure of their maximum subgraphs are different. We give the constructive lower bound of the largest subgraph of Beneš network of various maximum degrees.

Styles APA, Harvard, Vancouver, ISO, etc.

Frantzeskakis, Linos F., et Hanan Luss. « The network redesign problem for access telecommunications networks ». Naval Research Logistics 46, n^o 5 (août 1999) : 487–506. http://dx.doi.org/10.1002/(sici)1520-6750(199908)46:5<487 ::aid-nav3>3.0.co;2-b.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

WANG, QIN, et LONGSHU WU. « NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE ». ANZIAM Journal 58, n^o 3-4 (avril 2017) : 342–49. http://dx.doi.org/10.1017/s1446181117000116.

Texte intégral

Résumé :

We consider a class of network-design problems with minimum sum of modification and network costs for minimum spanning trees under Hamming distance. By constructing three auxiliary networks, we present a strongly polynomial-time algorithm for this problem. The method can be applied to solve many network-design problems. And, we show that a variation model of this problem is NP-hard, even when the underlying network is a tree, by transforming the 0–1 knapsack problem to this model.

Styles APA, Harvard, Vancouver, ISO, etc.

Ahmed, Ayam Tawfeek, Ahmed Noori Rashid et Khalid Shaker. « Localization in Wireless Sensor Network ». Webology 19, n^o 1 (20 janvier 2022) : 692–704. http://dx.doi.org/10.14704/web/v19i1/web19049.

Texte intégral

Résumé :

The major problems in a Wireless Sensor Networks (WSNs) is the localization problem, that relates to how an area covers by the sensor nodes. In this study, the problem formulates as the decision problem, that takes the best location for all sensors in the sensor field. Butterfly Optimization Algorithm (BOA), proposes to calculate the estimate locations for all sensors. Simulating the BOA with using number of sensors from 25 to 150 sensors and number of the anchor nodes. The distance between sensors and anchors measures by Received Signal Strength (RSS) so, this strategy is known as RSS-BOA. The obtained results shed that, the performance of the proposed algorithm is more accurate in comparing with BOA approach in the term sensor's location and the average error.

Styles APA, Harvard, Vancouver, ISO, etc.

Braunstein, Alfredo, Luca Dall’Asta, Guilhem Semerjian et Lenka Zdeborová. « Network dismantling ». Proceedings of the National Academy of Sciences 113, n^o 44 (18 octobre 2016) : 12368–73. http://dx.doi.org/10.1073/pnas.1605083113.

Texte intégral

Résumé :

We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For a large class of random graphs, this problem is tightly connected to the decycling problem (the removal of vertices, leaving the graph acyclic). Exploiting this connection and recent works on epidemic spreading, we present precise predictions for the minimal size of a dismantling set in a large random graph with a prescribed (light-tailed) degree distribution. Building on the statistical mechanics perspective, we propose a three-stage Min-Sum algorithm for efficiently dismantling networks, including heavy-tailed ones for which the dismantling and decycling problems are not equivalent. We also provide additional insights into the dismantling problem, concluding that it is an intrinsically collective problem and that optimal dismantling sets cannot be viewed as a collection of individually well-performing nodes.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Network of problem"

Araújo, Ricardo Matsumura de. « Memetic networks : problem-solving with social network models ». reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2010. http://hdl.handle.net/10183/25515.

Texte intégral

Résumé :

Sistemas sociais têm se tornado cada vez mais relevantes para a Ciência da Computação em geral e para a Inteligência Artificial em particular. Tal interesse iniciou-se pela necessidade de analisar-se sistemas baseados em agentes onde a interação social destes agentes pode ter um impacto no resultado esperado. Uma tendência mais recente vem da área de Processamento Social de Informações, Computação Social e outros métodos crowdsourced, que são caracterizados por sistemas de computação compostos de pessoas reais, com um forte componente social na interação entre estas. O conjunto de todas interações sociais e os atores envolvidos compõem uma rede social, que pode ter uma forte influência em o quão eficaz ou eficiente o sistema pode ser. Nesta tese, exploramos o papel de estruturas de redes em sistemas sociais que visam a solução de problemas. Enquadramos a solução de problemas como uma busca por soluções válidas em um espaço de estados e propomos um modelo - a Rede Memética - que é capaz de realizar busca utilizando troca de informações (memes) entre atores interagindo em uma rede social. Tal modelo é aplicado a uma variedade de cenários e mostramos como a presença da rede social pode melhorar a capacidade do sistema em encontrar soluções. Adicionalmente, relacionamos propriedades específicas de diversas redes bem conhecidas ao comportamento observado para os algoritmos propostos, resultando em um conjunto de regras gerais que podem melhorar o desempenho de tais sistemas sociais. Por fim, mostramos que os algoritmos propostos são competitivos com técnicas tradicionais de busca heurística em diversos cenários.
Social systems are increasingly relevant to computer science in general and artificial intelligence in particular. Such interest was first sparkled by agent-based systems where the social interaction of such agents can be relevant to the outcome produced. A more recent trend comes from the general area of Social Information Processing, Social Computing and other crowdsourced systems, which are characterized by computing systems composed of people and strong social interactions between them. The set of all social interactions and actors compose a social network, which may have strong influence on how effective the system can be. In this thesis, we explore the role of network structure in social systems aiming at solving problems, focusing on numerical and combinatorial optimization. We frame problem solving as a search for valid solutions in a state space and propose a model - the Memetic Network - that is able to perform search by using the exchange of information, named memes, between actors interacting in a social network. Such model is applied to a variety of scenarios and we show that the presence of a social network greatly improves the system capacity to find good solutions. In addition, we relate specific properties of many well-known networks to the behavior displayed by the proposed algorithms, resulting in a set of general rules that may improve the performance of such social systems. Finally, we show that the proposed algorithms can be competitive with traditional heuristic search algorithms in a number of scenarios.

Styles APA, Harvard, Vancouver, ISO, etc.

Balakrishnan, Anantaram, Thomas L. Magnanti et Prakash Mirchandani. « The Multi-Network Design Problem ». Massachusetts Institute of Technology, Operations Research Center, 1991. http://hdl.handle.net/1721.1/5200.

Texte intégral

Résumé :

This paper studies a new multi-facility network synthesis problem, called the Multi-level Network Design (MLND) problem, that arises in the topological design of hierarchical communication, transportation, and electric power distribution networks whose nodes have varying levels of importance:the more critical or higher level nodes require higher grade interconnections. Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels, the MLND problem seeks a connected design that minimizes total fixed cost while spanning all the nodes, and connecting nodes at each level via facilities of the corresponding or higher type. This problem generalizes the well-known Steiner network problem and the hierarchical network design problem. In this paper, we describe alternative model formulations for this problem and analyze the worst-case performance for heuristics based upon Steiner and spanning tree computations. For one model that we consider, the heuristic worst-case bounds on the performance ratio are either 4/3 or the worst-case performance ratio p of the embedded Steiner tree heuristic. A companion paper develops and tests a dual ascent procedure that generates tight upper and lower bounds on the optimal value of the problem. Keywords: Network design, integer programming, valid inequalities, worstcase analysis of heuristics.

Styles APA, Harvard, Vancouver, ISO, etc.

Leung, Cheuk Fun Bede. « Subnet generation problem : solutions to a new network routing problem ». Thesis, Imperial College London, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.444214.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Livada, M. « Implicit network descriptions of RLC networks and the problem of re-engineering ». Thesis, City, University of London, 2017. http://openaccess.city.ac.uk/17916/.

Texte intégral

Résumé :

The thesis deals with aspects of Systems Re-engineering specialised to the case of passive electrical networks. Re-engineering is a problem different from traditional control problems and this emerges when it is realised that the systems designed in the past cannot perform according to the new performance requirements and such performance cannot be improved by traditional control activities. Re-engineering implies that we intervene in early stages of system design involving sub-processes, values of physical elements, interconnection topology, selection of systems of inputs and outputs and of course retuning of control structures. This is a very challenging problem which has not been addressed before in a systematic way and needs fundamental new thinking, based on understanding of structure evolution during the stages of integrated design. A major challenge in the study of this problem is to have a system representation that allows study of evolution of system properties as well as structural invariants. For linear systems the traditional system representations, such as transfer functions, state space models and polynomial type models do not provide a suitable framework for study structure and property evolutions, since for every change we need to compute again these models and the transformations we have used do not appear in an explicit form in such models. It is for this reason, for a general system, such system representations are not suitable for study of system representations on re-engineering. It has been recognized that for the special family of systems defined by the passive electrical networks (RLC), there exists a representation introduced by the loop/ nodal analysis, expressed by the impedance/admittance integral-differential models, which have the property of re-engineering transformations of the following type: 1. Changing the values or possible nature of existing elements without changing the network topology, 2. Modifying the network topology without changing network cardinality, that is number of independent loops or nodes, 3. Augmenting or reducing the network by addition or deletion of sub-networks, 4. Combination of all the above transformations. These kinds of transformations may be represented as perturbations on the original impedance/admittance models. The above indicates that impedance/admittance integral-differential models, which from now on will be referred to as Implicit Network Descriptions is the natural vehicle for studying re-engineering on electrical networks. Although issues related to realisation of impedance/admittance transfer functions within RLC topologies, has been the topic of classical network synthesis, the system aspects of such descriptions have not been properly considered. Addressing problems of network re-engineering requires the development of the fundamental system aspects of such new descriptions in terms of McMillan degree, regularity and a number of other properties. Certain problems of evolution (of system properties) are linked to Frequency Assignment, as far as natural frequencies under re-engineering and this requires use of techniques developed within control theory for Frequency Assignment Problems.

Styles APA, Harvard, Vancouver, ISO, etc.

Hojati, Mehran. « Network synthesis problem : cost allocation and algorithms ». Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27318.

Texte intégral

Résumé :

This thesis is concerned with a network design problem which is referred to in the literature as the network synthesis problem. The objective is to design an undirected network, at a minimum cost, which satisfies known requirements, i.e., lower bounds on the maximum flows, between every pair of nodes. If the requirements are to be satisfied nonsimultaneously, i.e., one at a time, the problem is called the nonsimultaneous network synthesis problem, whereas if the requirements are to be satisfied simultaneously, the problem is called the simultaneous network synthesis problem. The total construction cost of the network is the sum of the construction cost of capacities on the edges, where the construction cost of a unit capacity is fixed for any edge, independent of the size of the capacity, but it may differ from edge to edge. The capacities are allowed to assume noninteger nonnegative values. The simultaneous network synthesis problem was efficiently solved by Gomory and Hu [60], whereas the nonsimultaneous network synthesis problem can only be formulated and solved as a linear program with a large number of constraints. However, the special equal-cost case, i.e., when the unit construction costs are equal across the edges, can be efficiently solved, see Gomory and Hu [60], by some combinatorial method, other than linear programming. A cost allocation problem which is associated with the network synthesis problem would naturally arise, if we assume that the various nodes in the network represent different users or communities. In this case, we need to find a fair method for allocating the construction cost of the network among the different users. An interesting generalization of the nonsimultaneous network synthesis problem, the Steiner network synthesis problem, is derived, when only a proper subset of the nodes have positive requirements from each other. The thesis is concerned with two issues. First, we will analyze the cost allocation problems arising in the simultaneous and the equal cost nonsimultaneous network synthesis problem. Secondly, we will consider the Steiner network synthesis problem, with particular emphasis on simplifying the computations in some special cases, not considered before. We will employ cooperative game theory to formulate the cost allocation problems, and we will prove that the derived games are 'concave', which implies the existence of the core and the inclusion of the Shapley value and the nucleolus in the core, and then we will present irredundant representations of the cores. For the equal cost nonsimultaneous network synthesis game, we will use the irredundant representation of the core to provide an explicit closed form expression for the nucleolus of the game, when the requirement structure is a spanning tree; then, we will develop, in a special case, a decomposition of the game, which we will later use to efficiently compute the Shapley value of the game when the requirement structure is a tree; the decomposition will also be used for the core and the nucleolus of the game in the special case. For the simultaneous network synthesis game, we will also use the irredundant representation of the core to derive an explicit closed form expression for the nucleolus, and we will also decompose the core of this game in the special case, and prove that the Shapley value and the nucleolus coincide. Secondly, for the Steiner network synthesis problem, two conceptually different contributions have been made, one being a simplifying transformation, and the other being the case when the network has to be embedded in (i.e., restricted to) some special graphs. Namely, when the requirement structure is sparse (because there are only a few demand nodes and the rest are just intermediate nodes) and the positive requirements are equal, we will employ a transformation procedure to simplify the computations. This will enable us to efficiently solve the Steiner network synthesis problem with five or less nodes which have equal positive requirements from each other. Finally, when the solution network to the Steiner network synthesis problem is to be embedded in (restricted to) some special graphs, namely trees, rings (circles), series-parallel graphs, or M₂ and M₃-free graphs, we will provide combinatorial algorithms which are expected to simplify the computations.
Business, Sauder School of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

Ramahi, Muhannad Hasan. « Resident Scheduling Problem ». Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/37057.

Texte intégral

Résumé :

This thesis is concerned with the Resident Scheduling Problem (RSP) in which a good schedule is desired that will meet both departmental requirements and residents' preferences. Three scenarios that represent most situations and account for various departmental requirements and needs are described. Although similar scheduling problems are considered in the literature, no analysis exists that adequately deals with this specific problem. The problem is modeled as a mixed-integer program (MIP) and heuristic solution procedures are developed for the different identified scheduling scenarios. These procedures exploit the network structure of the problem which is an important feature that enhances problem solvability. For the sake of comparison, the problem is also solved exactly via the CPLEX-MIP package. The contribution of this work is important since many hospitals are still utilizing manual techniques in preparing their own schedules, expending considerable effort and time with less scheduling flexibility.
Master of Science

Styles APA, Harvard, Vancouver, ISO, etc.

鄭國榮 et Kwok-wing Philip Cheng. « Some results on the location problem ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31215051.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Cheng, Kwok-wing Philip. « Some results on the location problem / ». Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19589074.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Magnanti, Thomas L., Prakash Mirchandani et Rita Vachani. « Modeling and Solving the Capacitated Network Loading Problem ». Massachusetts Institute of Technology, Operations Research Center, 1991. http://hdl.handle.net/1721.1/5375.

Texte intégral

Résumé :

This paper studies a topical and economically significant capacitated network design problem that arises in the telecommunications industry. In this problem, given point-topoint demand between various pairs of nodes of a network must be met by installing (loading) capacitated facilities on the arcs. The facilities are chosen from a small set of alternatives and loading a particular facility incurs an arc specific and facility dependent cost. The problem is to determine the configuration of facilities to be loaded on the arcs of the network that will satisfy the given demand at minimum cost. Since we need to install (load) facilities to carry the required traffic, we refer to the problem as the network loading problem. In this paper, we develop modeling and solution approaches for the problem. We consider two approaches for solving the underlying mixed integer programming model: (i) a Lagrangian relaxation strategy, and (ii) a cutting plane approach that uses three classes of valid inequalities that we identify for the problem. In particular, we show that a linear programming formulation that includes the valid inequalities always approximates the value of the mixed integer program at least as well as the Lagrangian relaxation bound (as measured by the gaps in the objective functions). We also examine the computational effectiveness of these inequalities on a set of prototypical telecommunications data. The computational results show that the addition of these inequalities considerably improves the gap between the integer programming formulation of the problem and its linear programming relaxation: for 6 - 15 node problems from an average of 25% to an average of 8%. These results show that strong cutting planes can be an effective modeling and algorithmic tool for solving problems of the size that arise in the telecommunications industry.

Styles APA, Harvard, Vancouver, ISO, etc.

Fréchette, Alexandre. « Hub routing for the robust network design problem ». Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=114431.

Texte intégral

Résumé :

Robust network design (RND) applies the concept of robustness from optimization with uncertainty to the area of network design. Primary motivations stem from applications in telecommunication networks. The main presupposition is that demands across the networks are variable or unpredictable. They originate from a predefined demand set, called a demand universe. Moreover, practical impediments of network design enforce the routing of the demands to be oblivious, or fixed in advance, and to not depend on a particular instantiation from the demand universe. Additional restrictions, referred to as a routing model, are often enforced on the routing's structure. Shortest paths (SP) and hub (HUB) routing models have received particular attention, both on the theoretical and practical level. In this work, we introduce a new routing model, called the hierarchical hub routing model (HH), as a generalization to HUB. We study the theoretical properties of RND restricted to HH (RNDHH). Namely, we show its APX-hardness and provide a O(log n)-approximation algorithm. We then show how RNDHH is tractable when the problem is constrained to a particular demand universe based on demands routable on a tree. We also compare the costs of optimal solutions to RND using HH and other important oblivious routing models. Finally, we leverage HH in a practical study of a new demand universe called the capped hose model, which is a blend of the hose and the pipe model, two widely used demand universes. We use the capped hose model to shed light on which demand universes favour more a SP-like as opposed to a HH-like routing. To do so, we develop a heuristic algorithm for RNDHH, and benchmark our approach against SP using representative carrier networks and a variety of capped hose demands, parametrized by their similitude to a hose or pipe model. This study reveals conditions under which multi-hub routings, that is HH, gives improvements over single-hub and shortest path routings.
Le design de réseaux robustes (RND) est celui qui applique le concept de robustesse, issu de l'optimisation avec incertitude, au domaine de la conception de réseaux. Les principales motivations derrière cette application découlent de demandes provenant des réseaux de télécommunication. La prémisse principale est que les demandes à travers les réseaux sont variables ou imprévisibles. Toutefois, nous savons que ces demandes proviennent d'un ensemble prédéfini appelé univers de demandes. De plus, des contraintes pratiques du design de réseaux requiert que le routage des demandes soit inconscient, ou fixé d'avance, et qu'il ne dépende pas d'une instanciation particulière de l'univers de demandes. Des contraintes additionnelles, connues sous le nom de modèle de routage, s'appliquent souvent à la structure du routage. Les routages par chemins les plus courts (SP) et par moyeu unique (HUB) ont reçu une attention importante, tant au niveau théorique que pratique. Dans cette thèse, nous introduisons un nouveau modèle de routage appelé routage hiérarchique par moyeux (HH), qui est une généralisation de HUB. Nous étudions les propriétés théoriques de RND restreint à HH (RNDHH). Plus particulièrement, nous démontrons son caractère APX-difficile et fournissons un algorithme O(log n)-approché. Par la suite, nous montrons comment RNDHH devient facilement soluble lorsque restreint à un univers de demandes particulier, basé sur des demandes qui peuvent être routées sur un arbre donné. Nous comparons également le coût des solutions optimales lorsque RND utilise HH ainsi que d'autres modèles de routage inconscients importants. Finalement, nous exploitons HH dans une étude pratique sur un nouvel univers de demandes, appelé modèle par tuyaux restreints, qui est un mélange de deux univers de demandes largement utilisés soit le modèle par tuyaux et le modèle par conduits. Nous utilisons le modèle par tuyaux restreints pour caractériser quel univers de demandes favorise un routage similaire à SP contrairement à un routage HH. Pour ce faire, nous développons un algorithme heuristique pour RNDHH et évaluons notre approche par rapport à SP à l'aide de réseaux d'opérateur ainsi que plusieurs types de demandes du modèle par tuyaux restreints, ceux-ci ayant été paramétrés par leur similitude à un modèle par tuyaux ou un modèle par conduits. Cette étude révèle les conditions à travers lesquelles le routage par multiples moyeux, c'est-à-dire HH, surpasse celui par HUB et SP.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "Network of problem"

Danner, Carl. Infrastructure and the telephone network : Defining the problem. Cambridge, Mass. (200 Aiken, Cambridge 02138) : Program on Information Resources Policy, Harvard University, Center for Information Policy Research, 1992.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Erik-Hans, Klijn, dir. Managing uncertainties in networks : A network approach to problem solving and decision making. London : Routledge, 2004.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Klir, George J. Architecture of Systems Problem Solving. Boston, MA : Springer US, 1985.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Balakrishnan, Anantaram. A composite algorithm for the concave-cost LTL consolidation problem. Cambridge, Mass : Massachusetts Institute of Technology, Alfred P. Sloan School of Management, 1985.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Balakrishnan, Anantaram. A composite algorithm for the concave-cost LTL consolidation problem. West Lafayette, Ind : Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Management, Purdue University, 1985.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Asbury, Stephen. CGI how-to : The definitive CGI scripting problem-solver. Corte Madera, CA : Waite Group Press, 1996.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

D, Palumbo, Arras Michael K et Langley Research Center, dir. Fault-tolerance of a neural network solving the Traveling Salesman Problem. Hampton, Va : National Aeronautics and Space Administration, Langley Research Center, 1989.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Protzel, Peter W. Fault-tolerance of a neural network solving the traveling salesman problem. Hampton, Va : ICASE, 1989.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Shaffi, Shazad A. Application of the neural network approach to the kidney patient problem. Manchester : UMIST, 1997.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Clarke-Griebsch, Stella. Overcoming the network problem in telepresence systems with prediction and inertia. München : Utz, 2008.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Chapitres de livres sur le sujet "Network of problem"

Wynants, Christelle. « Network Synthesis Problem ». Dans Combinatorial Optimization, 11–29. Boston, MA : Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-3349-5_2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Hampson, Steven E. « Operator and Network Structure ». Dans Connectionistic Problem Solving, 71–96. Boston, MA : Birkhäuser Boston, 1990. http://dx.doi.org/10.1007/978-1-4684-6770-3_5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Gass, Saul I., et Carl M. Harris. « Maximum-flow network problem ». Dans Encyclopedia of Operations Research and Management Science, 503. New York, NY : Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_605.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Jin, Cheng, Sugih Jamin, Danny Raz et Yuval Shavitt. « The Cache Location Problem ». Dans Building Scalable Network Services, 67–98. Boston, MA : Springer US, 2004. http://dx.doi.org/10.1007/978-1-4419-8897-3_5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kesidis, George. « The Flow Control Problem for ABR Traffic ». Dans ATM Network Performance, 99–111. Boston, MA : Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4559-0_5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kesidis, George. « The Flow Control Problem for ABR Traffic ». Dans ATM Network Performance, 77–90. Boston, MA : Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-4568-9_5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ziegler, U., et S. Göttlich. « Design Network Problem and Heuristics ». Dans Progress in Industrial Mathematics at ECMI 2008, 515–20. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12110-4_81.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

McGeer, Rick, David G. Andersen et Stephen Schwab. « The Network Testbed Mapping Problem ». Dans Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 383–98. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17851-1_30.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Henningsson, M., K. Holmberg, M. Rönnqvist et P. Värbrand. « A Ring Network Design Problem ». Dans Operations Research Proceedings 1998, 431–40. Berlin, Heidelberg : Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58409-1_42.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Acharya, H. B., et M. G. Gouda. « The Weak Network Tracing Problem ». Dans Distributed Computing and Networking, 184–94. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11322-2_21.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Network of problem"

Phillips, Cynthia A. « The network inhibition problem ». Dans the twenty-fifth annual ACM symposium. New York, New York, USA : ACM Press, 1993. http://dx.doi.org/10.1145/167088.167286.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

« The network maintenance problem ». Dans 22nd International Congress on Modelling and Simulation. Modelling and Simulation Society of Australia and New Zealand (MSSANZ), Inc., 2017. http://dx.doi.org/10.36334/modsim.2017.j5.charkhgard.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

F. Pinheiro, R., D. Colón et L. L. R. Reinoso. « Relating Lurie's problem, Hopfield's network and Alzheimer's disease ». Dans Congresso Brasileiro de Automática - 2020. sbabra, 2020. http://dx.doi.org/10.48011/asba.v2i1.1624.

Texte intégral

Résumé :

Alzheimer's disease is a degenerative brain disorder that affects millions of people around the world and still without cure. A very common application of Hopfield neural networks is to simulate a human memory as well as to evaluate problems of degeneration and memory loss. On the other hand, from the control area, one has Lurie's problem, which emerged in the 1940s and which still does not have a general solution. However many works and results came in an attempt to solve it. In this paper, the Hopfield's network is shown as a particular case of Lurie's problem, then one of the consequences of Alzheimer's disease, memory failure, is modeled using Hopfield's networks and nally a recent result of Lurie's problem is applied to the computationally modeled disease to correct the problem of memory loss. The correction is made using a controller via DK-iteration. Simulations are performed to validate the computational model of the disease and to demonstrate the effectiveness of the application of the recent Lurie's problem theorem. Therefore, in addition to the results presented, this work aims at encouraging the researches in the area, so that in the future, better diagnostic and treatment conditions will be achieved.

Styles APA, Harvard, Vancouver, ISO, etc.

Shao, Hu, Yanqiang Wu, Jian Zhao et Yuping Fang. « Network Design Problem under Uncertainty ». Dans 2011 Fourth International Joint Conference on Computational Sciences and Optimization (CSO). IEEE, 2011. http://dx.doi.org/10.1109/cso.2011.177.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Youlin Zhang et Junhui Zhu. « A location problem on network ». Dans 2010 International Conference on Computer Application and System Modeling (ICCASM 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccasm.2010.5622695.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mendyk-Krajewska, Teresa, et Zygmunt Mazur. « Problem of network security threats ». Dans 2010 3rd International Conference on Human System Interactions (HSI). IEEE, 2010. http://dx.doi.org/10.1109/hsi.2010.5514533.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Servin, M., F. J. Cuevas, A. Davila et J. L. Marroquin. « Deterministic neural network used in the nesting problem ». Dans OSA Annual Meeting. Washington, D.C. : Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.mii7.

Texte intégral

Résumé :

A deterministic neural network, used to solve the optimizing problem of nesting (how to put as many 2-D patterns as possible in a given irregular and finite larger area), is presented. Nesting is one of the most important operations that many industries have to deal with; such industries have to cut raw material into patterns that will be the building blocks of a product. Artificial neural networks have proved to be useful in solving n-p kind of problems where the number of possible solutions grow exponentially as the problem gets bigger. It is well known that any deterministic optimizing network of this type will in general find a local minimum of the problem at hand, close enough to the global minimum to be worth considering. We propose an internal energy function E that translates into mathematical terms the goal and the constraints of the nesting problem. Afterward a free energy F expression for this system, which is valid at high temperatures, is derived. A synchronous continuous system is proposed to find a minimum of this free energy and a solution to the problem is found, continuously decreasing the absolute temperature parameter of this system until it reaches the zero temperature where the minimum of the internal energy and the minimum of the free energy coincides, having as a consequence a solution to the initial nesting problem.

Styles APA, Harvard, Vancouver, ISO, etc.

Blenk, Andreas, Arsany Basta, Johannes Zerwas et Wolfgang Kellerer. « Pairing SDN with network virtualization : The network hypervisor placement problem ». Dans 2015 IEEE Conference on Network Function Virtualization and Software-Defined Networks (NFV-SDN). IEEE, 2015. http://dx.doi.org/10.1109/nfv-sdn.2015.7387427.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Alayande, Akintunde S., Adisa A. Jimoh et Adedayo A. Yusuff. « Solution to network usage allocation problem in power networks ». Dans 2016 IEEE International Conference on Renewable Energy Research and Applications (ICRERA). IEEE, 2016. http://dx.doi.org/10.1109/icrera.2016.7884428.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bezukladnikov, Igor I., et Aleksei V. Gavrilov. « Problem of network monitoring in distributed wireless sensor networks ». Dans 2016 IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference (EIConRusNW). IEEE, 2016. http://dx.doi.org/10.1109/eiconrusnw.2016.7448141.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Network of problem"

Arkko, J., B. Aboba et F. Bari. Network Discovery and Selection Problem. Sous la direction de J. Korhonen. RFC Editor, janvier 2008. http://dx.doi.org/10.17487/rfc5113.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chauhan, Darshan Rajesh. Robust Maximum Flow Network Interdiction Problem. Portland State University Library, janvier 2020. http://dx.doi.org/10.15760/etd.7315.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ng, C., P. Thubert, M. Watari et F. Zhao. Network Mobility Route Optimization Problem Statement. RFC Editor, juillet 2007. http://dx.doi.org/10.17487/rfc4888.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Black, D., L. Fang, L. Kreeger et M. Napierala. Problem Statement : Overlays for Network Virtualization. Sous la direction de T. Narten et E. Gray. RFC Editor, octobre 2014. http://dx.doi.org/10.17487/rfc7364.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Niven-Jenkins, B., F. Le Faucheur et N. Bitar. Content Distribution Network Interconnection (CDNI) Problem Statement. RFC Editor, septembre 2012. http://dx.doi.org/10.17487/rfc6707.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kempf, J., dir. Problem Statement for Network-Based Localized Mobility Management (NETLMM). RFC Editor, avril 2007. http://dx.doi.org/10.17487/rfc4830.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Lincoln, Patrick, et Charles J. Pedersen. A Problem-Solving Environment for Biological Network Informatics : Bio-Spice. Fort Belvoir, VA : Defense Technical Information Center, juin 2007. http://dx.doi.org/10.21236/ada471395.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Goldberg, Andrew V., Michael D. Grigoriadis et Robert E. Tarjan. Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem. Fort Belvoir, VA : Defense Technical Information Center, octobre 1988. http://dx.doi.org/10.21236/ada214691.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Adrangi, F., et H. Levkowetz, dir. Problem Statement : Mobile IPv4 Traversal of Virtual Private Network (VPN) Gateways. RFC Editor, août 2005. http://dx.doi.org/10.17487/rfc4093.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Talpey, T., et C. Juszczak. Network File System (NFS) Remote Direct Memory Access (RDMA) Problem Statement. RFC Editor, mai 2009. http://dx.doi.org/10.17487/rfc5532.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!