Location:
Search - np c
Search list
Description: 1. compile:
mpicc cjacobi.c -o cjacobi -lm
2. run:
mpirun -np 4 cjacobi
3. result:
Input of file \"dataIn.txt\"
Platform: |
Size: 2272 |
Author: 王通 |
Hits:
Description: 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP problem: have n cities, a salesman from one of a city of departure, each city can only traverse once traveled all the requirements of the City , and then returned to his starting city, and all the possible path of the shortest path to a path.
Platform: |
Size: 4096 |
Author: bianbian |
Hits:
Description: 1. compile:
mpicc cjacobi.c -o cjacobi -lm
2. run:
mpirun -np 4 cjacobi
3. result:
Input of file "dataIn.txt"-1. compile:
mpicc cjacobi.c-o cjacobi-lm
2. run:
mpirun-np 4 cjacobi
3. result:
Input of file "dataIn.txt"
Platform: |
Size: 2048 |
Author: 王通 |
Hits:
Description: 最新能过NP得CE，我测试过了，希望能给大家帮助-NP was able to have the latest CE, I tested and I hope we can help
Platform: |
Size: 1049600 |
Author: 四金 |
Hits:
Description: The most horrible onliner in C you even have seen :-) Use gcc -E to generate the code... This code just return true if a solution exist.
This code solves the problem of the "count down number" http://en.wikipedia.org/wiki/Countdown_ 28game_show 29#Numbers_round, wich is similar to the BIN-PACKING NP-Complete problem.
email://blanvill/gmail/com-The most horrible onliner in C you even have seen :-) Use gcc-E to generate the code... This code just return true if a solution exist.
This code solves the problem of the "count down number" http://en.wikipedia.org/wiki/Countdown_ 28game_show 29#Numbers_round, wich is similar to the BIN-PACKING NP-Complete problem.
email://blanvill/gmail/com
Platform: |
Size: 1024 |
Author: blanvill |
Hits:
Description: 例如：
编译：mpicc app_match.c邻app_match
运行：可以使用命令mpirun - np的尺寸app_match mnk来运行该串匹配程序，其中大小是所使用的处理器个数，米表示文本串长度，氮为模式串长度，钾为允许误差长度。本实例中使用了尺寸为3个处理器，米= 7，n = 2时，k = 1时。
mpirun - np的3 app_match 7 2 1
运行结果：
在节点0的文字是
在节点0的模式是
共有2匹配在节点0
节点1上的文本为
在节点1的模式是
共有2匹配的节点1
节点2上的文字是天然抗氧化剂
在节点2的模式为
共有2匹配的节点2
说明：该运行实例中，令文本串长度为7，随机产生的文本串为asasbsb，分布在3个节点上 模式串长度为2，随机产生的模式串为为。最后，节点0,1和二上分别得到两个近似匹配位置。
-For example:
Compile: mpicc app_match.c o app_match
Run: You can use the command mpirun- np size app_match mnk to run the string matching procedure, which size is the number of processors used, the text string length in meters, the length of pattern of nitrogen and potassium to allow for error length. The examples used in the size of three processors, m = 7, n = 2 时, k = 1 时.
mpirun- np of 3 app_match 7 2 1
Run Results:
Node 0 in the text is
Node 0 in the model is
Total 2 match at the node 0
Node 1 on the text
Node 1 is in the mode
A total of 2 matching node 1
Node 2, the text is a natural antioxidant
Node 2 in the model
A total of 2 matching node 2
Description: The running instance, so that the text string of length 7, randomly generated text string to asasbsb, located in three nodes mode string length is 2, the model randomly generated string to the. Finally, the nodes 0,1 and 2, respectively, are two approximate matching position.
Platform: |
Size: 5120 |
Author: aaa |
Hits:
Description: Example
编译：mpicc mst.c mst
运行：本实例中使用了5个处理器。
mpirun –np 5 mst
运行结果：
Input the size of matrix:9
0 4 5 8 6 2 5 7 3
5 0 8 3 1 6 4 9 5
7 2 0 6 4 1 3 8 9
4 5 6 0 5 7 2 1 6
4 5 8 7 0 2 3 4 7
4 1 4 7 5 0 7 8 4
7 8 9 3 2 1 0 6 7
4 2 1 4 3 5 8 0 9
5 3 2 8 9 7 6 2 0
最终输出结果：
the MST is:
0 0 0 0 0 2 0 0 0
0 0 0 0 1 1 0 0 0
0 0 0 0 0 1 0 1 2
0 0 0 0 0 0 0 1 0
0 1 0 0 0 2 0 0 0
2 1 1 0 2 0 1 0 0
0 0 0 0 0 1 0 0 0
0 0 1 1 0 0 0 0 0
0 0 2 0 0 0 0 0 0
说明：输出结果为最小生成树的边。
-
Example
Compile: mpicc mst.c mst
Run: The example of the use of the five processors.
mpirun-np 5 mst
Run Results:
Input the size of matrix: 9
045,862,573
508,316,495
720,641,389
456,057,216
458,702,347
414,750,784
789,321,067
421,435,809
532,897,620
The final output:
the MST is:
000,002,000
000,011,000
000,001,012
000,000,010
010,002,000
211,020,100
000,001,000
001,100,000
002 million
Description: The output for the minimum spanning tree edges.
Platform: |
Size: 2048 |
Author: aaa |
Hits:
Description: Example:
编译：mpicc including.c –o including
运行：可以使用命令 mpirun –np SIZE including来运行该串匹配程序，其中SIZE是所使用的处理器个数。本实例中使用了SIZE=4个处理器。
mpirun –np 4 including
运行结果：
请输入点的个数:6
请输入各点的坐标
0：1 0
1：2 1
2：4 0
3：2 4
4：1 2
5：0 3
请输入要判断点的坐标
2 3
结果：vertex p is in polygon
说明：输入顶点的(x,y)坐标时中间用空格隔开。
-Example:
Compile: mpicc including.c-o including
Run: You can use the command mpirun-np SIZE including to run the string matching procedure, which SIZE is the number of processors used. The examples used SIZE = 4 processors.
mpirun-np 4 including
Run Results:
Please input the number: 6
Please input the coordinates of the points
0:1 0
1:2 1
2:4 0
3:2 4
4:1 2
5:0 3
Enter To determine the coordinates of points
23
Results: vertex p is in polygon
Description: Enter the vertices (x, y) coordinates separated by a space.
Platform: |
Size: 2048 |
Author: aaa |
Hits:
Description: 编译：mpicc intersect.c –o intersect
运行：可以使用命令 mpirun –np SIZE intersect来运行该串匹配程序，其中SIZE是所使用的处理器个数，本实例中使用了SIZE=3个处理器。
mpirun –np 3 intersect
运行结果：
输入：
please input first polygon
please input the count of vetex:3
please input the vertex
3 2
2 5
4 3
please input second polygon
please input the count of vetex:6
please input the vertex
0 1
1 -1
1 -2
6 2
5 4
1 4
输出：
两多边形相交
说明：输入顶点的(x,y)坐标时中间用空格隔开。
-
Compile: mpicc intersect.c-o intersect
Run: You can use the command mpirun-np SIZE intersect to run the string matching procedure, which SIZE is the number of processors used in this instance the use of the SIZE = 3 processors.
mpirun-np 3 intersect
Run Results:
Input:
please input first polygon
please input the count of vetex: 3
please input the vertex
32
25
43
please input second polygon
please input the count of vetex: 6
please input the vertex
01
1-1
1-2
62
54
14
Output:
Intersection of two polygons
Description: Enter the vertices (x, y) coordinates separated by a space.
Platform: |
Size: 3072 |
Author: aaa |
Hits:
Description: Flash3d研究所推荐的最新pv3d傻瓜包，包括现在pv3d几乎所有用到的类-PAPER ON ERVIS NPAPER ISION PE IS ON PERVI IO APER SI PA
AP VI ONPA RV IO PA SI PA ER SI NP PE ON AP VI ION AP
PERVI ON PE VISIO APER IONPA RV IO PA RVIS NP PE IS ONPAPE
ER NPAPER IS PE ON PE ISIO AP IO PA ER SI NP PER
RV PA RV SI ERVISI NP ER IO PE VISIO AP VISI PA RV3D
______________________________________________________________________
papervision3d.org+ blog.papervision3d.org+ osflash.org/papervision3d
Copyright 2006-2008 (c) Carlos Ulloa Matesanz, noventaynueve.com.
Core Team :
Carlos Ulloa
John Grden
Ralph Hauwert
Tim Knip
Andy Zupko
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without
restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit p
Platform: |
Size: 518144 |
Author: 啊 |
Hits:
Description: 1. 架构说明
目前的协议有如下一些特点:
1) 客户向服务器发送请求, 每个请求的长度不定. 请求的长度在第一个INT中指定.
2) 每个服务器通常会向多种客户提供服务, 例如, TS要同时向CP, NP提供服务,
CP要向NP和其他CP提供服务, 同时还是其他CP, TS, SP的客户.
3) 每个服务器为客户服务时, 通常是长期的, 会涉及多次请求-应答的来回.
这样的结构, 主要是为了能够支持大量并发客户连接而设计的. 在具有大量并发客户
连接时, 无论采用线程还是进程, 都无法进行有效的服务, 因此必须采用select
轮询方式.
2. 基本数据结构说明
对于每个客户端, 需要保存该客户端相应的一些信息. 目前的CPnew.c, SPnew.c
和TSnew.c的核心数据结构基本相同, 都由Session,
SessionCluster (TSnew.c中) 或者 ServerDesc (CPnew.c和SPnew.c)构成.
其中, Session是每个客户端相关的数据, SessionCluster(或者是ServerDesc)是
有关每种服务的信息, 其中有一个指向该服务相关的各个Session的指针. Session
这一数据结构不是在有客户请求时动态分配的, 而是在最开始初始化时就已经分配
好的, 当有新客户请求到来时, 服务器搜索这一预先分配好的这些Session, 发现其中
有空闲则使用, 如果没有空闲就报告错误.-1. Architecture Description
The current agreement has the following features:
1) The client sends a request to the server, each request the length of the variable. The length of the request specified in the first INT.
2) each server would usually offer a variety of services, such as, TS to the same time to the CP, NP to provide services
CP and CP to the NP to provide services, or other CP, TS, SP customers.
3) customer service for each server, usually long-term, will involve multiple requests- response back and forth.
Such a structure, mainly to be able to support large numbers of concurrent client connections and design. In a large number of concurrent clients
Connection, regardless of the thread or process can not effectively service, so must select
Polling.
2. The basic data structure that
For each client, the corresponding need to save the client some information. The current CPnew.c, SPnew.c
And TSnew.c the core data structure is basically the same, by the Session,
Platform: |
Size: 3427328 |
Author: 风行者 |
Hits:
Description: 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。用2种方法实现背包问题，用C语言编写，数据结构课内试验-Knapsack problem (Knapsack problem) is NP-complete combinatorial optimization problem. Problem can be described as: Given a set of items, each item has its own weight and price, the total weight limit, we choose, to make up the total price of items. 2 methods used to achieve knapsack problem, using C language, data structure testing curricular
Platform: |
Size: 1026048 |
Author: linfuhong |
Hits:
Description: 具有NP-C性质的QoS路由优化已经成为网络研究中的一个热点问题， 粒
子群算法所具有的优点成为解决 QoS 路由优化的有效方式。-With NP-C nature of the QoS routing optimization has become a network of research of a hot issue, grain The son has the advantages of the algorithm to solve the optimization of the effective way QoS routing.
Platform: |
Size: 117760 |
Author: |
Hits:
Description: 遗传算法解决旅行商Np问题,采用vs2008环境 用c++编写的源文件 有需要的参考 -sovle tsp problem
Platform: |
Size: 15364096 |
Author: qichuan |
Hits:
Description: 企业费用管理系统，报销审批统计功能，采用JSP、servelet、mysql设计。-允许输入拉丁字符的拼音请键入文字或网站地址，或者上传文档。
取消
Qǐyè fèiyòng guǎnlǐ xìtǒng, bàoxiāo shěnpī tǒngjì gōngnéng, cǎiyòng JSP,servelet,mysql shèjì.英语中文(简体)日语Alpha
Enterprise cost management system, reimbursement approval statistical functions, using JSP, servelet, mysql design.
Platform: |
Size: 11253760 |
Author: yuxl |
Hits:
Description: mpicc -o closure .c -lm
运行：可以使用命令 mpirun –np SIZE closure来运行生成的默认文件closure，其中SIZE是所使用的处理器个数-mpicc-o closure closure.c-lm run: You can use the command mpirun-np the SIZE a closure to run the generated default file a closure, where SIZE is used by the processor number
Platform: |
Size: 2048 |
Author: 张勇 |
Hits:
Description: C#学习其实还是蛮实用的，供大家学习参考
希望最大家有用-C# learning but it is still quite useful for everyone to learn reference
I hope most useful to everyone
Platform: |
Size: 16400384 |
Author: 张益达 |
Hits:
Description: SeaPai 烧写MAC地址 机型: FR_WA(1014-1024)NP-C -SeaPai MAC address programming models: FR_WA (1014-1024) NP-C
Platform: |
Size: 15523840 |
Author: ice |
Hits:
Description: 用C语言实现了退火算法解决NP旅行商问题，遍历所有点走最短路径(Annealing algorithm to solve NP problem)
Platform: |
Size: 279552 |
Author: 芦大大
|
Hits: