-
Desktop
调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
- 2010-02-19 23:31:11下载
- 积分：1
-
stund_0.92_Jun06
一个UDP穿透NAT的例子，遵守RFC3489(a UDP penetrate NAT example, compliance with RFC3489)
- 2004-11-17 23:51:28下载
- 积分：1
-
Client
远程控制客户通过象服务器端发出请求，服务器接受请求，从而实现对服务器的控制。(Remote Control client through the server-side as a request, the server accepted the request to the server in order to achieve control.)
- 2008-04-24 10:10:11下载
- 积分：1
-
LineChartControlDemo
用于机床铣削力建模计算，通过该程序可很好的队铣削力进行预测(Machine Tool Cutting Force Modeling for computing, the adoption of the program can be a very good team to predict milling force)
- 2020-12-14 23:39:13下载
- 积分：1
-
onvif-discovery_cs
onvif协议 源代码 实例 vc++ discovery_cs(onvif protocol source code examples vc++ discovery_cs)
- 2014-04-11 19:51:38下载
- 积分：1
-
12adc
12adc转换，如果是C语言的 这个 就太好了！不过 希望大家 做稍微的改动！(12adc)
- 2009-10-08 00:58:05下载
- 积分：1
-
Example2
主要描述的是一个界面的问题，大家可以编译一下！看看其功能特点！(The main interface is a description of the problem, we can compile click! Take a look at its features!)
- 2009-02-15 20:08:59下载
- 积分：1
-
zuixiaoquandingdianfugai
给定一个赋权无向图G=(V,E)，每个定点v∈U都有一个权值w(v)。如果U V，且对任意(u,v)∈E有u∈U或v∈U，就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。(Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on U that map G to a fixed-point coverage. G the right to the minimum vertex cover is contained in G refers to the right vertex of the vertex cover and minimum.)
- 2020-11-19 15:59:39下载
- 积分：1
-
prim
prim算法,输出最小生成树,时间复杂度Nlog(n)(prim algorithm)
- 2013-04-13 14:19:16下载
- 积分：1
-
S-Function
s函数的编程说明,有具体实例说明，介绍了其工作原理(It s a good article of s-function.)
- 2012-03-08 15:16:25下载
- 积分：1
