Suchergebnisse - "Fast constructive algorithm"
-
1
An XGBoost-enhanced fast constructive algorithm for food delivery route planning problem
ISSN: 0360-8352, 1879-0550Veröffentlicht: Elsevier Ltd 01.02.2021Veröffentlicht in Computers & industrial engineering (01.02.2021)“… •Food delivery route planning problem is studied.•XGBoost-enhanced fast constructive algorithm is proposed …”
Volltext
Journal Article -
2
A fast constructive algorithm for fixed channel assignment problem
ISBN: 9780780366855, 0780366859Veröffentlicht: IEEE 2001Veröffentlicht in 2001 IEEE International Symposium on Circuits and Systems (2001)“… In this work, a fast constructive algorithm is introduced to solve the problem. The objective of the algorithm is to obtain a conflict free channel assignment to cells which satisfies traffic demand requirements …”
Volltext
Tagungsbericht -
3
A fast constructive path planning algorithm for mobile robot navigation
Veröffentlicht: IEEE 07.09.2021Veröffentlicht in 2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA ) (07.09.2021)“… Path planning is a vitally important ability for autonomous mobile robots. Because of the high computational complexity, the optimal solution is generally …”
Volltext
Tagungsbericht -
4
Improving constructive training of RBF networks through selective pruning and model selection
ISSN: 0925-2312, 1872-8286Veröffentlicht: Elsevier B.V 01.03.2005Veröffentlicht in Neurocomputing (Amsterdam) (01.03.2005)“… The proposed method is an extension of the dynamic decay adjustment (DDA) algorithm, a fast constructive algorithm for classification problems …”
Volltext
Journal Article -
5
ON the influence of parameter theta- on performance of RBF neural networks trained with the dynamic decay adjustment algorithm
ISSN: 0129-0657Veröffentlicht: Singapore 01.08.2006Veröffentlicht in International journal of neural systems (01.08.2006)“… The dynamic decay adjustment (DDA) algorithm is a fast constructive algorithm for training RBF neural networks (RBFNs …”
Weitere Angaben
Journal Article -
6
Heuristics for the General Multiple Non-linear Knapsack Problem
ISSN: 1571-0653, 1571-0653Veröffentlicht: Elsevier B.V 01.11.2016Veröffentlicht in Electronic notes in discrete mathematics (01.11.2016)“… First, we design a fast constructive algorithm that provides good initial solutions. Secondly, we improve the quality of these solutions through local search procedures …”
Volltext
Journal Article -
7
Improving RBF-DDA performance on optical character recognition through parameter selection
ISBN: 0769521282, 9780769521282ISSN: 1051-4651Veröffentlicht: IEEE 2004Veröffentlicht in Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004 (2004)“… The dynamic decay adjustment (DDA) algorithm is a fast constructive algorithm for training RBF neural networks …”
Volltext
Tagungsbericht -
8
Improving RBF-DDA Performance on Optical Character Recognition through Weights Adjustment
ISBN: 9780780394902, 0780394909ISSN: 2161-4393Veröffentlicht: IEEE 2006Veröffentlicht in The 2006 IEEE International Joint Conference on Neural Network Proceedings (2006)“… The dynamic decay adjustment (DDA) algorithm is a fast constructive algorithm for training RBF neural networks …”
Volltext
Tagungsbericht -
9
A study on the influence of parameter 6 on performance of RBF neural networks trained with the dynamic decay adjustment algorithm
ISBN: 0769524575, 9780769524573Veröffentlicht: IEEE 2005Veröffentlicht in Fifth International Conference on Hybrid Intelligent Systems : HIS 2005 : [proceedings] : 6-9 November, 2005, Rio de Janerio, Brazil (2005)“… The dynamic decay adjustment (DDA) algorithm is a fast constructive algorithm for training RBF and PNN neural networks …”
Volltext
Tagungsbericht -
10
Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances
ISSN: 0305-215X, 1029-0273Veröffentlicht: Abingdon Taylor & Francis 02.01.2016Veröffentlicht in Engineering optimization (02.01.2016)“… The objective is to minimize the makespan. For this unary NP-hard problem, two fast constructive algorithms with a complexity of O(n 2 ) are presented …”
Volltext
Journal Article

