-
BridgePatternMain
bridge pattern in c++.
vs2010, vs2010
- 2014-02-27 15:45:15下载
- 积分：1
-
vcPP6.0shujukulianjie
c++连接数据库不可多得的材料，包括ODBC和DAO数据库，希望可以帮助您(c++ connected databases rare material, including ODBC and DAO database, hope can help you)
- 2012-10-31 08:43:44下载
- 积分：1
-
lineprint
模拟字符方式（非GUI方式）打印 (Simulating character printing)
- 2001-01-06 17:00:20下载
- 积分：1
-
EmailManagement
数据库课程设计简单的邮件管理系统。可以用VS2013连接oracle数据库，实现一些简单的操作(Database design courses simple mail management system. VS2013 can be used to connect oracle , to achieve some simple operations)
- 2016-01-06 21:09:48下载
- 积分：1
-
RegSample_Pdo
说明： 本程序是一个关于内存操作的驱动程序。希望对大家有所帮助。(this program is a memory operation on the driver. We want to help.)
- 2006-04-01 16:31:49下载
- 积分：1
-
zhuce2
很好的注册机2
很强 很牛
很有研究价值()
- 2009-09-14 23:13:36下载
- 积分：1
-
研华AD程序
研究研华模块得AD转换程序(Research Institute in China Blocks AD conversion)
- 2020-09-10 11:58:01下载
- 积分：1
-
ajks
说明： 许多现代浮点单元的一项主要体系结构功能，是能够将一个乘法与后面紧跟的加法作为单个运算执 行，且没有中间舍入误差。例如，Intel 的 Itanium 体系结构提供了一些指令，将三元运算 (a*b+c) 、(a*b-c) 和 (c-a*b) 中的每一个都组合为单个浮点指令（分别为 fma、fms 和 fnma）。这些单个 指令都比执行独立的乘法和加法指令快，并且因为没有中间乘法舍入，所以更为精确。该优化可以显 著提高那些含有多个交错乘法和加法运算的函数的速度(many modern floating point unit of a major system structure and function is to be a follow closely behind multiplication and addition of implementation as a single operator, with no intermediate rounding error. For example, Intel's Itanium architecture provides a number of directives to the ternary operator (a* b, c), (a* b-c) and (c-a* b) each have a portfolio to a single floating point instructions (Fullmetal respectively, and fms fnma) . These individual instruction than the implementation of an independent and additive multiplication instructions quickly, and because no middle multiplication into homes, so more precise. The optimization can significantly increase those containing more than staggered multiplication and addition operations function of the speed)
- 2006-03-23 20:52:57下载
- 积分：1
-
telescope-com
望远镜串口通讯程序，包括Meade望远镜通讯协议文档和三篇串口通讯论文(The telescopes serial communication program, including Meade Telescope communication protocol documentation and three serial communication papers)
- 2012-11-09 17:17:21下载
- 积分：1
-
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
