Finding the right coupling of learning and evolution in a hybrid algorithm is an open problem. In this article, we present a strategy to adjust the time spent on learning during evolutionary optimization of neural networks. The proposed adaptation scheme leads to a significant improvement in performance. It is empirically shown that suitable learning strategies strongly depend on the problem an...

The central region of the Galaxy has been observed at 580, 620 and 1010 MHz with the Giant Metrewave Radio Telescope (GMRT). We detect emission from Sgr A*, the compact object at the dynamical centre of the Galaxy, and estimate its flux density at 620 MHz to be 0.5±0.1 Jy. This is the first detection of Sgr A* below 1 GHz (Roy & Rao 2002, 2003), which along with a possible detection at 330 MHz ...

In “A note on a theorem of Erdös & Gallai” ([6]) one identifies the nonredundant inequalities in a characterization of graphical sequences. We explain how this result may be obtained directly from a simple geometrical observation involving weak majorization. A sequence of positive integers d1, d2, . . . , dp is called graphical if it is the degree sequence of a graph, i.e., there is a graph who...

Zverovich, I.E. and V.E. Zverovich, Contributions to the theory of graphic sequences, Discrete Mathematics 105 (1992) 293-303. In this article we present a new version of the ErdGs-Gallai theorem concerning graphicness of the degree sequences. The best conditions of all known on the reduction of the number of Erdiis-Gallai inequalities are given. Moreover, we prove a criterion of the bipartite ...

This formulation of the Roy-Floyd-Warshall algorithm for the transitive closure bypasses matrices and arrays, but uses a more direct mathematical model with adjacency functions for immediate predecessors and successors. This can be implemented efficiently in functional programming languages and is particularly adequate for sparse relations.