搜索：Problem - 虫虫下载站

数据库系统  Generating next numbers in SQLServer should not be a problem. But problems arise when a customer ask

Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle this problem in different scenarios.

https://www.eeworm.com/dl/523/103161.html

下载: 170

查看: 1063

人工智能/神经网络  aco for TSP problem source code

aco for TSP problem source code

https://www.eeworm.com/dl/650/125370.html

下载: 150

查看: 1064

教育系统应用  题目：多线程同步方法解决生产者－消费者问题（Bounded - Buffer Problem）内容：有界缓冲区内设有１０个存储单元

题目：多线程同步方法解决生产者－消费者问题（Bounded - Buffer Problem）内容：有界缓冲区内设有１０个存储单元，放入／取出的数据项设定为１～１０这１０个整形数。要求每个生产者和消费者对有界缓冲区进行操作后，即时显示有界缓冲区的全部内容、当前指针位置和生产者／消费者标识符。 ...

https://www.eeworm.com/dl/621/134652.html

下载: 126

查看: 1169

Java书籍  dining philosophers problem

dining philosophers problem

https://www.eeworm.com/dl/656/134803.html

下载: 53

查看: 1099

电子书籍  Computer Networks 4th Edition Problem Solutions.pdf计算机网络第四版的习题解答。是原版

Computer Networks 4th Edition Problem Solutions.pdf计算机网络第四版的习题解答。是原版，但是有些章节的有几个问题的解答存在错误。本身书上的问题也有错误。

https://www.eeworm.com/dl/cadence/ebook/137145.html

下载: 120

查看: 1110

人工智能/神经网络  this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this

this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this tar also include some testfiles and config file and a readme which describes how to run this program.

https://www.eeworm.com/dl/650/140257.html

下载: 62

查看: 1106

游戏  Using Genetic Algorithm to solve the 8 Queens problem.

Using Genetic Algorithm to solve the 8 Queens problem.

https://www.eeworm.com/dl/625/156947.html

下载: 37

查看: 1082

数学计算  王勖成《有限单元法》里面的教学源程序,PROGRAM OF PLANE PROBLEM 96.1

王勖成《有限单元法》里面的教学源程序,PROGRAM OF PLANE PROBLEM 96.1

https://www.eeworm.com/dl/641/161432.html

下载: 107

查看: 1154

数据结构  实现背包问题 package problem 1．问题描述假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品

实现背包问题 package problem 1．问题描述假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2）、（1，4 ...

https://www.eeworm.com/dl/654/162971.html

下载: 37

查看: 1863

人工智能/神经网络  fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memo

fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memory, so that larger trees and/or more bootstrap replicates become tractable. Much of fastDNAml is merely a recoding of the PHYLIP 3.3 DNAML program from PASCAL to C.

https://www.eeworm.com/dl/650/165117.html

下载: 153

查看: 1043

搜索结果

按分类筛选