Sciweavers

648 search results - page 45 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
GECCO
2004
Springer
14 years 1 months ago
Self Adaptation of Operator Rates in Evolutionary Algorithms
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...
Jonatan Gomez
IPPS
1998
IEEE
14 years 7 hour ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
NETWORK
2010
122views more  NETWORK 2010»
13 years 2 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
14 years 1 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic
NPL
1998
129views more  NPL 1998»
13 years 7 months ago
Extraction of Logical Rules from Neural Networks
A new architecture and method for feature selection and extraction of logical rules from neural networks trained with backpropagation algorithm is presented. The network consists ...
Wlodzislaw Duch, Rafal Adamczak, Krzysztof Grabcze...