Sciweavers

2349 search results - page 194 / 470
» Performing time-sensitive network experiments
Sort
View
CN
2007
106views more  CN 2007»
14 years 10 months ago
MIPv6 experimental evaluation using overlay networks
The commercial deployment of Mobile IPv6 has been hastened by the concepts of Integrated Wireless Networks and Overlay Networks, which are present in the notion of the forthcoming...
Pablo Vidales, Carlos Jesus Bernardos, Ignacio Sot...
ML
2006
ACM
142views Machine Learning» more  ML 2006»
14 years 10 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
NN
2008
Springer
146views Neural Networks» more  NN 2008»
14 years 10 months ago
Clustering and co-evolution to construct neural network ensembles: An experimental study
This paper introduces an approach called Clustering and Co-evolution to Construct Neural Network Ensembles (CONE). This approach creates neural network ensembles in an innovative ...
Fernanda L. Minku, Teresa Bernarda Ludermir
CEC
2005
IEEE
15 years 4 months ago
Genetic programming approach for fault modeling of electronic hardware
This paper presents two variants of Genetic Programming (GP) approaches for intelligent online performance monitoring of electronic circuits and systems. Reliability modeling of el...
Ajith Abraham, Crina Grosan
ASIAMS
2007
IEEE
15 years 5 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham