Location:
Search - ai
Search list
Description: Evenly spaces the cities on the perimeter of a wheel and returns a vector of their coordinates
利用AI技术生成一个圆-Evenly spaces the cities on the perimeter of a wheel and returns a vector of their coordinates the use of AI technology to generate a circle
Platform: |
Size: 67584 |
Author: yby |
Hits:
Description: 人工智能游戏编程真言一书附带的源码，这一章主要讲解A*寻路算法的原理和应用。这是第一个示例，很有参考意义。-AI Game Programming mantra source attached to a book, this chapter the main road on the A* search algorithm and application of the principle. This is the first example, very useful.
Platform: |
Size: 82944 |
Author: lincolnwang |
Hits:
Description: 人工智能游戏编程真言一书附带的源码，这一章主要讲解A*寻路算法的原理和应用。这是第二个示例，很有参考意义。-AI Game Programming mantra source attached to a book, this chapter the main road on the A* search algorithm and application of the principle. This is the second example, is very useful.
Platform: |
Size: 3072 |
Author: lincolnwang |
Hits:
Description: 人工智能游戏编程真言一书附带的源码，这一章主要讲解A*寻路算法的原理和应用。这是第三个示例，很有参考意义。-AI Game Programming mantra source attached to a book, this chapter the main road on the A* search algorithm and application of the principle. This is the third example, is very useful.
Platform: |
Size: 2048 |
Author: lincolnwang |
Hits:
Description: 人工智能游戏编程真言一书附带的源码，这一章主要讲解A*寻路算法的原理和应用。这是第四个示例，很有参考意义。-AI Game Programming mantra source attached to a book, this chapter the main road on the A* search algorithm and application of the principle. This is the fourth example, the meaning of a good reference.
Platform: |
Size: 4096 |
Author: lincolnwang |
Hits:
Description: 深入系列
Primer 第三版
著
中文版 潘爱民 张丽 译-Primer-depth series of the third edition of the translated Chinese version of PAN Ai-min Zhang
Platform: |
Size: 3978240 |
Author: 李朋勃 |
Hits:
Description: Java版中国象棋人机对战源代码，作者将AI算法用得淋漓尽致，具有很高的学习研究价值。-Java version of Chinese chess against human-machine source code, the author will use AI algorithms thoroughly, study and research of high value.
Platform: |
Size: 1771520 |
Author: 丁丁 |
Hits:
Description: AI五子棋。人机对战。画面也不错。可以学到很多！-Gobang AI. Man-machine war. Screen is not bad. Can learn a lot!
Platform: |
Size: 3688448 |
Author: |
Hits:
Description: Problem B:Longest Ordered Subsequence
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8). -Problem B: Longest Ordered SubsequenceA numeric sequence of ai is ordered if a1 <a2 <... <aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 <i2 <... <iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, eg, ( 1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, eg, (1, 3, 5, 8).
Platform: |
Size: 1024 |
Author: hzf |
Hits:
Description: 两台处理机A 和B处理n个作业。设第i个作业交给机器
A 处理时需要时间ai，若由机器B 来处理，则需要时间bi。由于各作
业的特点和机器的性能关系，很可能对于某些i，有ai >=bi，而对于
某些j，j!=i，有aj<bj。既不能将一个作业分开由两台机器处理，也没
有一台机器能同时处理2 个作业。设计一个动态规划算法，使得这两
台机器处理完成这n 个作业的时间最短（从任何一台机器开工到最后
一台机器停工的总时间）。研究一个实例：（a1,a2,a3,a4,a5,a6）=
（2,5,7,10,5,2）；（b1,b2,b3,b4,b5,b6）=（3,8,4,11,3,4）-Two processors A and B deal with n-operation. I set up the first operating the machine A treatment takes time ai, if by machine B to deal with, it takes time bi. Since the operating characteristics and performance of the machine relationship, is likely to for some i, there is ai> = bi, and for some j, j! = I, there is aj <bj. Neither can an operation separate from the two machines to deal with, nor a machine capable of simultaneously handling two operations. Design a dynamic programming algorithm, making the two machines to deal with the completion of this n the shortest operating time (from any one machine starts to the last machine downtime total time). Study an example of: (a1, a2, a3, a4, a5, a6) = (2,5,7,10,5,2) (b1, b2, b3, b4, b5, b6) = (3,8 , 4,11,3,4)
Platform: |
Size: 14336 |
Author: 王颖 |
Hits:
Description: robocup中国科技大学2队的代码，守门员代码写得很好，总体写得也是相当不错的-RoboCup China Science and Technology University 2 team code, code written in a very good goalkeeper, on the whole is written in fairly good
Platform: |
Size: 422912 |
Author: letmecc |
Hits:
Description: 适合C++初学者的入门书籍。深入C++系列，中文版；Stanley B Lippman著；潘爱民 张丽译；中国电力出版社；内容分五篇，共20章，很全面。-For C++ Introductory books for beginners. Depth C++ Series, the Chinese version Stanley B Lippman forward PAN Ai-min Zhang Li translation China Electric Power Publishing House the contents of sub-5, a total of 20 chapters, very comprehensive.
Platform: |
Size: 3996672 |
Author: lixiaoyang |
Hits:
Description: ai上的一道题国际象棋。语言是C++，都是过了的-ai together on the chess title. Language is C++, Are all over the
Platform: |
Size: 889856 |
Author: 赵双 |
Hits:
Description: ai上的一道题是比较经典的画家问题，题好我不记得了，因该是过了的要不我就穿错文件了-ai together on the title is a more classic artists problems, a good title I do not remember, because it is over whether the documents I Misdraw
Platform: |
Size: 1926144 |
Author: 赵双 |
Hits:
Description: 中国象棋的游戏源码，使用了人工智能的Alpha-Beta搜索算法-Chinese chess game source code, the use of artificial intelligence Alpha-Beta Search Algorithm
Platform: |
Size: 107520 |
Author: 佚名 |
Hits:
Description: A vision based navigation system for autonomous aircraft.pdf
Platform: |
Size: 907264 |
Author: 张建宏 |
Hits:
Description: 一套围棋游戏 带AI的 很不错 值得学习一下 棋盘格数可变-Go with a set of game AI is very well worth learning about the number of checkerboard grid variable
Platform: |
Size: 3747840 |
Author: 王晓 |
Hits:
Description: chat messsage用于聊天室的后台程序 非常全面适合初学者学习-chat rooms chat messsage for the background process is very comprehensive for beginners to learn
Platform: |
Size: 1143808 |
Author: chen |
Hits:
Description: AVR单片节使用模拟量输入的处理代码
和大家交流学习
该代码已成在产品中国使用-AVR chip using the analog input section of the processing code and to facilitate the exchange of learning the code has been used in China in product
Platform: |
Size: 22528 |
Author: 邴松 |
Hits:
Description: C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？
要求：输入K，n，a1，a2......an
输出：他能最多带出的宝物价值
-C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures
Platform: |
Size: 1024 |
Author: shubin |
Hits: