4072 search results - page 278 / 815 » Designing an Optimal Network Using the Cross-Entropy Method |
165
click to vote
SBRN
2000
IEEE
15 years 10 months ago
2000
IEEE
d Articles >> Table of Contents >> Abstract VI Brazilian Symposium on Neural Networks (SBRN'00) p. 24 Adaptation of Parameters of BP Algorithm Using Automata Hamid...
208
click to vote
GECCO
2009
Springer
16 years 29 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
156
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
144
click to vote
ANSS
1998
IEEE
15 years 10 months ago
1998
IEEE
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...
159
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Currently real time PCR is the most precise method by which to measure gene expression. The method generates a large amount of raw numerical data and processing may no...