Pages that link to "Item:Q1354427"
From MaRDI portal
The following pages link to An overtraining-resistant stochastic modeling method for pattern recognition (Q1354427):
Displaying 14 items.
- Predictive learning via rule ensembles (Q71543) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Approximation algorithms for time-constrained scheduling on line networks (Q693767) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Pruning of error correcting output codes by optimization of accuracy-diversity trade off (Q890296) (← links)
- Maximum \(k\)-splittable \(s, t\)-flows (Q927403) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- A concrete statistical realization of Kleinberg's stochastic dicrimination for pattern recognition. I: Two-class classification (Q1431432) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Traffic engineering of management flows by link augmentations on confluent trees (Q2471695) (← links)
- On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
