Sciweavers

770 search results - page 49 / 154
» Latent Class Models for Algorithm Portfolio Methods
Sort
View
160
Voted
NETWORKING
2000
15 years 3 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
139
Voted
NIPS
2008
15 years 4 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang
NIPS
2007
15 years 4 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 8 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
131
Voted
ISNN
2009
Springer
15 years 9 months ago
Use of Ensemble Based on GA for Imbalance Problem
In real-world applications, it has been observed that class imbalance (significant differences in class prior probabilities) may produce an important deterioration of the classifie...
Laura Cleofas, Rosa Maria Valdovinos, Vicente Garc...