# Network problems

Duplicate IP Addresses IP Address Exhaustion DNS Problems Single Workstation Unable to Connect to the Network

** Non-linear network problems **

free download

1. Flow problems . We shall be concerned with connected networks. These will be defined as finite connected graphs, on which the boundary is explicitly specified. As a graph such a network consists of a finite set N of nodes (or vertices), Ai An, certain nodes being

** A new method of solving transportation- network problems **

free download

Transportation problems constitute one of the most important and practically useful branches of Operations Research (see, eg,[lJ,[2J and [3J). Usually they are formulated as the problem of finding a set of Xi/S (i= l, , m; j= l, . , n) which minimizes subject to the conditions nThis volume brings forth a set of papers presented at the conference on Variational Inequalities and network equilibrium problems , held in Erice at the G. Stampacchia School of the E. Majorana Centre for Scientific Culture in the period 19~ 25 June 1994. The

** Theoretical improvements in algorithmic efficiency for network flow problems **

free download

This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on the numbers of steps in these algorithms are derived, and are shown to compale favorably with

** Fuzzy shortest-path network problems with uncertain edge weights**

free download

This paper presents two new types of fuzzy shortest-path network problems . We consider the edge weight of the network as uncertain, which means that it is either imprecise or unknown. Thus, the first type of fuzzy shortest-path problem uses triangular fuzzy numbers for the

** The primal-dual method for approximation algorithms and its application to network design problems **

free download

The primal-dual method is a standard tool in the design of algorithms for combinatorial optimization problems . This chapter shows how the primal-dual method can be modi ed to provide good approximation algorithms for a wide variety of NP-hard problems . We

** Models and algorithms on contraflow evacuation planning network problems **

free download

After different disasters the evacuation planning support to remove the residence from accidental areas to safe destinations. Contraflow solutions minimize the congestion and make the traffic smooth during evacuation by reversing the required road directions from risk

** Better approximation bounds for the network and Euclidean Steiner tree problems **

free download

Abstract The network and Euclidean Steiner tree problems require a shortest tree spanning a given vertex subset within a network G=(V; E; d) and Euclidean plane, respectively. For these problems , we present a series of heuristics nding approximate Steiner tree with

** Network autocorrelation models: Problems and prospects**

free download

Overview: Network autocorrelation models draw their inspiration from, and share a common representation with, spatial autocorrelation models. The use of a Weight matrix, W, to capture network interdependencies and the statement of linear equations provide the

** Fremont: A System for Discovering Network Characteristics and Problems .**

free download

In this paper we present an architecture and prototype implementation for discovering key network characteristics, such as hosts, gateways, and topology. The Fremont system uses an extensible set of modules to discover information, based on a variety of different protocols

** Transportation problems on a fuzzy network **

free download

This paper considers fuzzy transportation problems with satisfaction degrees of routes since except of transportation costs about routes, its safety or transportation time etc should be taken into account. Further flexibility of demand and supply quantity should also be taken

** Exact and memetic algorithms for two network design problems **

free download

This thesis focuses on two combinatorial optimization problems (COPs) that belong to the class of NP-hard network design problems : The first one, vertex biconnectivity augmentation (V2AUG), appears in the design of survivable communication or electricity networks. In this

** Real world applications of network related problems and breakthroughs in solving them efficiently**

free download

Networks and network related problems occur with remarkable frequency in practical mathematical programming applications. This paper presents a variety of applications from industry and government that illustrate the scope and usefulness of network related

** Practical characteristics of neural network and conventional pattern classifiers on artificial and speech problems **

free download

Eight neural net and conventional pattern classifiers (Bayesianunimodal Gaussian, k- nearest neighbor, standard back-propagation, adaptive-stepsize back-propagation, hypersphere, feature-map, learning vector quantizer, and binary decision tree) wereA network interdiction problem usually involves two players who compete in a min max or max min game. One player, the network owner, tries to optimize its objective over the network , for example, as measured by a shortest path, maximum flow, or minimum cost flow

** Minimum cost network flows: Problems , algorithms, and software**

free download

We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear single-commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems , either tractable or intractable. We also

** Network music performance- problems , approaches and perspectives**

free download

With the current Internet bandwidth capacities and machine processing performance the personal computer has become an affordable and flexible multimedia platform for high quality audio and video content. Besides the delivery of services such as TV, telephone and

** A systematic approach to network coding problems using conflict graphs**

free download

We present a new approach to network coding problems that could lead to a systematic method for deciding solvability of a given network . The approach is based on a graph theoretic formulation of the problem. The constraints at each node in the network are

** A comparison between three neural network models for classification problems **

free download

This study reports the results from three artificial neural network models. Levenberg- Marquardt (LM), Generalized Regression Neural Networks (GRNN) and Learning Vector Quantization (LVQ) are applied to eight classification problems . Ten-fold cross validation is

** Formulations and algorithms for network design problems with connectivity requirements**

free download

Recent rapid technological advances (including high-capacity fiber-optic cables) in the tele- communications industry have introduced numerous opportunities for services other than traditional voice transmission. Disruptions in service for these high capacity systems can be

FREE IEEE PAPER

COMMENTcomputer-science