Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - k-tuples
Search - k-tuples - List
DL : 0
最佳调度问题,假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度,使得完成全部任务的时间最早。 -Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission.
Date : 2025-07-01 Size : 1kb User : 朱亚华

DL : 0
KNN算法分析及研究,将训练元组和测试元组看作是n维(若元组有n的属性)空间内的点,给定一条测试元组,搜索n维空间,找出与测试元组最相近的k个点(即训练元组),最后取这k个点中的多数类作为测试元组的类别。-Yuan KNN algorithm analysis and research, the training set and test set as a n d have the n properties (if a tuple) within the space of points, given a test tuples, search n dimensional space, find out and test a tuple closest point of k (i.e., training tuples), finally take most of these k points such as testing a tuple categories.
Date : 2025-07-01 Size : 188kb User : duanyy
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.