登录
首页 » 其他项目 » ascii码超级查询

ascii码超级查询

于 2022-02-03 发布 文件大小:32.57 kB
0 261
下载积分: 2 下载次数: 1

代码说明:

ascii码超级查询-ascii codes Super inquiries

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • From Microsoft
    从微软网站上下的,介绍了公共裤Compact Framework 2.0_OpenNETCF Smart Device Framework 2.0.rar的新增内容,转发给同行--windows mobile开发者-From Microsoft
    2022-03-07 07:01:37下载
    积分:1
  • 用先进的串行端口
    advanced Serial port with verilog
    2023-04-25 02:05:03下载
    积分:1
  • 编程 工具栏的制作 可供初学者参考使用
    编程 工具栏的制作 可供初学者参考使用-programming tools for the production column reference beginners
    2023-03-12 22:55:03下载
    积分:1
  • 该文档详细介绍了supermap的一些基本知识,让用户能详细了解supermap。...
    该文档详细介绍了supermap的一些基本知识,让用户能详细了解supermap。-The document detailed the SuperMap some basic knowledge, so that users can learn more about supermap.
    2022-02-28 16:15:50下载
    积分:1
  • C++ Builder 帮助文档,比较全的Builder帮助文档
    C++ Builder 帮助文档,比较全的Builder帮助文档-C++ Builder help documentation, comparing the whole of the Builder help documentation
    2022-03-13 13:51:25下载
    积分:1
  • tidsp2407 assembler routines, complete source code.
    tidsp2407汇编程序例程,完整的源代码。-tidsp2407 assembler routines, complete source code.
    2022-03-26 08:42:02下载
    积分:1
  • 网络流媒体源码,基于ARM,包含原理图。非常详细
    网络流媒体项目源码,基于ARM,包含原理图。非常详细-Network source streaming media projects, based on the ARM, contains schematics. Very detailed
    2022-02-04 21:49:26下载
    积分:1
  • Pocket 1945 is a classic shooter inspired by the classic 1942 game. The game is...
    Pocket 1945 is a classic shooter inspired by the classic 1942 game. The game is written in C# targeting the .NET Compact Framework. This article is my first submission to Code Project and is my contribution to ongoing .NET CF competition.
    2022-05-08 20:43:25下载
    积分:1
  • 对于 c# 的 CPM 代码
    此代码包含在 C# 语言中实现的关键路径方法。
    2022-02-15 22:07:32下载
    积分:1
  • An improved tabu search algorithm to solve knapsack problem. The algorithm is ba...
     提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu search techniques, using I & D strategies, while designed for the local optimal solution of the two kinds of mutation operator. The improved algorithm can effectively compensate for the standard tabu search algorithm depends on the initial solution defect, but also to avoid the phenomenon of search stagnation. Through specific examples and random-question test, indicating that the improved tabu search algorithm has better performance. Guan
    2022-01-21 20:56:01下载
    积分:1
  • 696516资源总数
  • 106432会员总数
  • 11今日下载