Results 1  10
of
59
Global Optimization Algorithms  Theory and Application
, 2011
"... This ebook is devoted to Global Optimization algorithms, which are methods for finding solutions of high quality for an incredible wide range of problems. We introduce the basic concepts of optimization and discuss features which make optimization problems difficult and thus, should be considered ..."
Abstract

Cited by 94 (26 self)
 Add to MetaCart
This ebook is devoted to Global Optimization algorithms, which are methods for finding solutions of high quality for an incredible wide range of problems. We introduce the basic concepts of optimization and discuss features which make optimization problems difficult and thus, should be considered when trying to solve them. In this book, we focus on
On the application of voltage graphs to the degree/diameter problem
, 2012
"... Following the techniques used by Loz and ˇ Siráň (Australasian Journal of Combinatorics 41 6380), we improve some of the best available lower bounds on the order of graphs with given maximum degree and diameter. For maximum degree up to 15 and diameter up to 10, a table with the best values is main ..."
Abstract
 Add to MetaCart
is maintained online by Comellas, Delorme and Loz. Our results have already been updated in that table. 1
Cayley Graphs and Interconnection Networks
, 1997
"... In this report, we will focus on routing problems including connectivity, diameter and loads of routings. We place the emphasis on load problems, since new classes of vertextransitive graphs (see quasiCayley graphs in Section 5.3) or edgetransitive graphs (see regular orbital graphs in Section 5. ..."
Abstract

Cited by 72 (3 self)
 Add to MetaCart
In this report, we will focus on routing problems including connectivity, diameter and loads of routings. We place the emphasis on load problems, since new classes of vertextransitive graphs (see quasiCayley graphs in Section 5.3) or edgetransitive graphs (see regular orbital graphs in Section 5.6) were studied in order to enlarge the class of graphs behaving well for loads of routings. More precisely, after recalling some basic definitions and properties in Chapter 2, we survey particular classes of Cayley graphs which are often studied as models of interconnection networks. First, we study Cayley graphs generated by transpositions (Section 3.1) and those with a special automorphism which rotates the generators and is called a complete rotation (Section 3.2). In Section 3.3, we present hierarchical Cayley digraphs and results about fault tolerance. Finally, multistage Cayley digraphs and their quotients are studied in Section 3.4.
High dimensional Apollonian networks
 J Phys A: Math Gen
"... Abstract. We propose a simple algorithm which produces high dimensional Apollonian networks with both smallworld and scalefree characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their d ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
Abstract. We propose a simple algorithm which produces high dimensional Apollonian networks with both smallworld and scalefree characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their dimension. PACS numbers: 89.75.Hc, 89.75.Da, 89.20.HhHigh dimensional Apollonian networks 2
An ant algorithm for the graph colouring problem
 ANTS’98  FROM ANT COLONIES TO ARTIFICIAL ANTS: FIRST INTERNATIONAL WORKSHOP ON ANT COLONY OPTIMIZATIONN ANT COLONY OPTIMIZATION
, 1998
"... This paper describes an ant algorithm that colours graphs in an efficient way. First, we describe the graph colouring problem and the ant algorithm. We also present some results and propose a simple generalisation of the algorithm that might allow its application to other assignment problems. Finall ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper describes an ant algorithm that colours graphs in an efficient way. First, we describe the graph colouring problem and the ant algorithm. We also present some results and propose a simple generalisation of the algorithm that might allow its application to other assignment problems. Finally, a short study of the algorithm operators explains its performance and shows that it may be seen as a parallel variation of tabu search, with an implicit memory instead of an avoidance list.
Steering Committee:
, 2003
"... IWIN 2003 is the 7th edition of the series of International Workshops on Interconnection Networks, holding every two years. After Marseilles (France) in 199195, Prague (Czech Rep.) in 1997, ..."
Abstract
 Add to MetaCart
IWIN 2003 is the 7th edition of the series of International Workshops on Interconnection Networks, holding every two years. After Marseilles (France) in 199195, Prague (Czech Rep.) in 1997,
A multiagent algorithm for graph partitioning
"... The kcut problem is an NPcomplete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we prese ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The kcut problem is an NPcomplete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we present a new simple multiagent algorithm, ants, and we test its performance with standard graph benchmarks. The results show that this method can outperform several current methods while it is very simple to implement.
Using genetic algorithms to design constant weight codes
 Proceedings of the International Workshop on Applications of Neural Networks to Telecommunications
, 1993
"... Genetic algorithms have been used successfully for solving di erent combinatorial optimization problems. We give here a new e cient application for the search of constant weight codes. The algorithm presented is intended to generate codes with the maximum number of codewords for a given length, cons ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Genetic algorithms have been used successfully for solving di erent combinatorial optimization problems. We give here a new e cient application for the search of constant weight codes. The algorithm presented is intended to generate codes with the maximum number of codewords for a given length, constant weight and minimum Hamming distance. A comparison with the simulated annealing technique is also discussed. On the other hand, the algorithm introduces a new scaling for the cost function that proved to be more e ective than other scalings used in the literature. 1
Modeling complex networks with selfsimilar outerplanar unclustered graphs
, 2009
"... This paper introduces a family of modular, selfsimilar, smallworld graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low clustering, like the power grid or some electronic circuits. Moreover, the gr ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This paper introduces a family of modular, selfsimilar, smallworld graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low clustering, like the power grid or some electronic circuits. Moreover, the graphs are outerplanar and it is know that many algorithms that are NPcomplete for general graphs perform polynomial in outerplanar graphs. Therefore the graphs constitute a good mathematical model for these systems.
Graph coloring algorithms for assignment problems in radio networks
 APPLICATIONS OF NEURAL NETWORKS TO TELECOMMUNICATIONS 2
, 1995
"... Assignment problems in radio networks, like the channel assignment, may be solved by graph coloring algorithms. In this paper we compare the performance of several recent techniques on a simple coloring problem: the search for a bipartite subgraph with the maximum number of edges of a given graph. T ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Assignment problems in radio networks, like the channel assignment, may be solved by graph coloring algorithms. In this paper we compare the performance of several recent techniques on a simple coloring problem: the search for a bipartite subgraph with the maximum number of edges of a given graph. The algorithms considered are a neural network, a genetic algorithm, simulated annealing and two heuristics. The results show that one heuristic, a new proposed multiagent system, and the standard simulated annealing technique are faster outperforming the algorithms in the literature. We also show how the algorithms may be easily adapted to deal with the kcoloring of a graph and can therefore be used for solving assignment problems in telecommunications.
Results 1  10
of
59