搜索结果

找到约 846 项符合 Set-TOP 的查询结果

数值算法/人工智能 DAKOTA

Computational models are commonly used in engineering design and scientific discovery activities for simulating complex physical systems in disciplines such as fluid mechanics, structural dynamics, heat transfer, nonlinear structural mechanics, shock physics, and many others. These simulators can be ...
https://www.eeworm.com/dl/510304.html
下载: 1
查看: 27

行业应用 抓包工具fi

Fiddler is a free web debugging tool which logs all HTTP(S) traffic between your computer and the Internet. Inspect traffic, set breakpoints
https://www.eeworm.com/dl/511477.html
下载: 1
查看: 87

多媒体处理 透明音乐播放器

[开源 绿色软件] [运行环境 Windows XP/7/8/10] [语言 简体/繁體/English/Unicode] A cool music player. Powered by Bass and BassVis. 极简本地音乐播放器,透明、纯文本界面。支持轻媒体库、歌词、可视化。最小化到托盘,占用资源少,适合边听音乐边工作。 应网友要求,加入了Tag编辑、自动切换列表、播放队列、鼠标手 ...
https://www.eeworm.com/dl/511585.html
下载: 2
查看: 224

Jsp/Servlet asp实现限制一个ip只能访问一次的方法

asp实现限制一个ip只能访问一次的方法 <%  '/////////////////////////////////////////////////////  '// //  '//作用:一个IP地址只允许访问本页一次 //  '//引用:<!-- #include file="Check_Ip.asp" --> //  '// //  '/////////////////////////////////////////////////////  ...
https://www.eeworm.com/dl/512322.html
查看: 30

源码 利用栈的基本操作实现将任意一个十进制整数N转化为R进制整数。

#include <stdlib.h> #include<stdio.h> #include <malloc.h> #define stack_init_size 100 #define stackincrement 10 typedef struct sqstack { int *base; int *top; int stacksize; } sqstack; int StackInit(sqstack *s) { s->base=(int *)malloc(stack_init_size *sizeof(int)); if(!s->base) return 0; s->top=s->ba ...
https://www.eeworm.com/dl/513582.html
查看: 40

源码 运动会源代码

#include <malloc.h>       #include <stdio.h>       #include <stdlib.h>       #include <string.h>       #define NULL 0    &nbsp ...
https://www.eeworm.com/dl/513814.html
下载: 2
查看: 9

源码 C语言算法排序问题

1.Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.)
https://www.eeworm.com/dl/514506.html
下载: 1
查看: 10

源码 c语言算法排序

1.Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.) #include<stdio.h> #include<stdlib.h> void merge(int arr[],int low,int mid,int high){   ...
https://www.eeworm.com/dl/514507.html
下载: 1
查看: 15

手册 TMS320F240 instruction set

TMS320F240DSP的汇编指令,用于了解该型号dsp的汇编指令的及具体含义,以便进行汇编指令的编写
https://www.eeworm.com/dl/516102.html
下载: 2
查看: 63

源码 数据结构实验

#include <iostream> #include <stdio.head> #include <stdlib.head> #include <string.head> #define ElemType int #define max 100 using namespace std; typedef struct node1 { ElemType data; struct node1 *next; }Node1,*LinkList;//链栈 typedef struct { ElemType *base; int top; }SqStack;// ...
https://www.eeworm.com/dl/517414.html
下载: 2
查看: 50