A Study of Routing and Fairness Algorithms in Voice-Data Networks
Ioannis Gragopoulos, Fotini - Niovi Pavlidou (1994)
The Yugoslav Journal of Operations Research
Similarity:
Ioannis Gragopoulos, Fotini - Niovi Pavlidou (1994)
The Yugoslav Journal of Operations Research
Similarity:
Krzysztof Walkowiak (2005)
International Journal of Applied Mathematics and Computer Science
Similarity:
This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern...
Giuliano Grossi, Massimo Marchi, Roberto Posenato (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better...
Wilsin Gosti, Tiziano Villa, Alex Saldanha, Alberto Sangiovanni-Vincentelli (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.
Martinovic, Goran, Aleksi, Ivan, Baumgartner, Alfonzo (2008)
Mathematical Problems in Engineering
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
C.-J. Seger, J. A. Brzozowski (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Dimiter Ivanchev, Elena Radovanova (2009)
The Yugoslav Journal of Operations Research
Similarity:
Romain Pepy, Michel Kieffer, Eric Walter (2009)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementations, where compact sets are wrapped into boxes. The resulting path planner is then used for...
Sayed, Moustafa A., Maksoud, Ehab Y.Abdel (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity: