-
mxbwye8
2 record the source code of the the rid_device_info_keyboard
- 2017-04-15 09:05:05下载
- 积分：1
-
hua-wei-bi-shi-mian-shi-zi-liao
华为很多年的面试以及笔试的题目，最找工作还是很有用(hua wei mian shi yi ji bi shi ti mu)
- 2011-10-29 16:35:06下载
- 积分：1
-
oSIP.Net-master
oSIP c# wrapper
- 2019-07-11 14:21:48下载
- 积分：1
-
CE340_Timers
说明： timers for embedded projects
- 2019-03-21 19:47:55下载
- 积分：1
-
fro
dkfhskdjh kjdshfk sdhk dskjfs dkfs fks kdfshdkjfh sfkjs dfk hskdfjh
- 2018-02-10 06:18:07下载
- 积分：1
-
KalmanFilter 递归程序，非常经典
KalmanFilter 递归程序，非常经典-KalmanFilter recursive procedures, very classic
- 2022-01-22 11:53:21下载
- 积分：1
-
SharePoint-Creating-Content-Types-Programmaticall
Creating Content Types Programmatically for SharePoint 2010
- 2014-03-13 08:27:57下载
- 积分：1
-
atm-corr
说明： 利用IDL进行遥感图像的大气校正，详细说明等(Using IDL for atmospheric correction of remote sensing image, detailed description, etc)
- 2020-04-19 15:46:54下载
- 积分：1
-
局部搜索图着色
说明： 图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。
数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory.
Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)
- 2021-04-01 16:49:10下载
- 积分：1
-
jquery支持图片点击放大缩小效果
适合做图文并茂效果，图片点击放大缩小，并可左右切换(Suitable for graphic and image effects, pictures click enlarge and reduce, and can switch around.)
- 2018-11-11 15:03:33下载
- 积分：1
