搜索结果
找到约 13 项符合
greedy 的查询结果
按分类筛选
人工智能/神经网络 Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form
Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the examples that are misclassified by each classifie ...
Linux/Unix编程 acm防御导弹问题详细解答
acm防御导弹问题详细解答，所用方法为dp 和greedy algorithm，完整的解决了这个问题。
其他书籍 The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some no
The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a ...