CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - ai
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - ai - List
[
Linux-Unix
]
littlegreenbats-svn2007.11.18.tar
DL : 0
The Little Green BATS is the first and so far only Dutch team in the 3D simulation league. We are a group of graduate students from the department of AI at the University of Groningen, The Netherlands. Our team name is derived from the fact that the first 3D agents in the league were balls and from the very philosophical observation that Balls Are Truly Spheres (BATS). This abbreviation reminded us of our favorite song Little Green Bag by The George Baker Selection and so the whole team name was born. We entered the competition for the first time at the 10th edition of RoboCup at Bremen, Germany. unfortunately our hard work didn t pay off that time: already in the second round we got eliminated. However, after this we had a good base to build upon and the good time we had at the event and the nice community inspired us to continue and work hard for another year. This turned out to be defiantly worth it, because in 2007 in Atlanta we managed to become vice world champions!
Date
: 2008-10-13
Size
: 468.44kb
User
:
jiangchao
[
Linux-Unix
]
littlegreenbats-svn2007.11.18.tar
DL : 0
The Little Green BATS is the first and so far only Dutch team in the 3D simulation league. We are a group of graduate students from the department of AI at the University of Groningen, The Netherlands. Our team name is derived from the fact that the first 3D agents in the league were balls and from the very philosophical observation that Balls Are Truly Spheres (BATS). This abbreviation reminded us of our favorite song Little Green Bag by The George Baker Selection and so the whole team name was born. We entered the competition for the first time at the 10th edition of RoboCup at Bremen, Germany. unfortunately our hard work didn t pay off that time: already in the second round we got eliminated. However, after this we had a good base to build upon and the good time we had at the event and the nice community inspired us to continue and work hard for another year. This turned out to be defiantly worth it, because in 2007 in Atlanta we managed to become vice world champions!
Date
: 2026-01-10
Size
: 468kb
User
:
jiangchao
[
Linux-Unix
]
FFLib_2009_1_20.tar
DL : 0
fflib的AI开发框架,自己写的,不是网上随便找的-fflib framework for ai
Date
: 2026-01-10
Size
: 1.78mb
User
:
OTHER
[
Linux-Unix
]
starfighter-1.1-1.tar
DL : 0
After decades of war one company, who had gained powerful supplying both sides with weaponary, steps forwards and crushes both warring factions in one swift movement. Using far superior weaponary and AI craft, the company was completely unstoppable and now no one can stand in their way. Thousands began to perish under the iron fist of the company. The people cried out for a saviour, for someone to light this dark hour... and someone did.
Date
: 2026-01-10
Size
: 2.41mb
User
:
tarice
[
Linux-Unix
]
comedi-0.7.60.tar
DL : 0
Comedi drivers for many AI and DIO card
Date
: 2026-01-10
Size
: 242kb
User
:
DimaKL
[
Linux-Unix
]
3pcf
DL : 0
3PCF计算多线程实现 定义: 点集D、R。 定义D中的点为ai∈D,R中的点为bi∈R。 距离:r1、r2、r3、err 求: 满足以下条件的三元组(空间中三角形)的数目 <ai, bm, bn>,|ai-bm|=r1±err且|ai-bn|=r2±err且|bm-bn|=r3±err 原始解法: 对于D中每一点ai,在R中找到与之距离为r1的点集R’,找到与之距离为r2的点集R’’。在点集R’与R’’中,查找两点间距离为r3的点组数目。累加。 -3PCF Multithread computing definition: point sets D, R. The point of the definition of D ai ∈ D, R in the point of bi ∈ R. Distance: r1, r2, r3, err requirements: the triple meet the following conditions (space triangle) the number of <ai, bm, bn> , | Ai-bm | = r1 ± err and | ai-bn | = r2 ± err and | bm-bn | = r3 ± err original solution: For D, each point ai, found in R with the distance r1 point set R ' , find the point with a distance r2 set R' ' . In the point set R ' and R' ' , find the distance between two points in the point group for the number of r3. Accumulation.
Date
: 2026-01-10
Size
: 1kb
User
:
Junki Lee
[
Linux-Unix
]
src
DL : 0
国际象棋fruit引擎源码,AI功能强大国外源码-Chess fruit engine code, the AI powerful foreign source code
Date
: 2026-01-10
Size
: 89kb
User
:
dingtianyou
[
Linux-Unix
]
snake_ai.tar
DL : 0
用qt写的贪吃蛇,自带简单ai,可以键盘控制。刚学qt,练手用的。初学者可以看下-qt snake ai
Date
: 2026-01-10
Size
: 660kb
User
:
yangjy
[
Linux-Unix
]
hw1.scm.tar
DL : 0
Scheme lab 1 for basic funtion of a mit scheme language. Useful for AI development.
Date
: 2026-01-10
Size
: 3kb
User
:
Kal
[
Linux-Unix
]
AI.tar
DL : 0
Qt 下的十滴水AI自动解法,包含UI设计和B*优先搜索算法-Dishui AI automatic solution under Qt
Date
: 2026-01-10
Size
: 335kb
User
:
李修
[
Linux-Unix
]
lpg1.2-source.tar
DL : 0
规划器,lpg1.2 IPC比赛的源代码,能解决时间、持续动作、数值等方面的约束-AI panning
Date
: 2026-01-10
Size
: 386kb
User
:
[
Linux-Unix
]
ai
DL : 0
求爱的For courtship -For courtshipFor courtshipFor courtship
Date
: 2026-01-10
Size
: 6.18mb
User
:
方浩然
[
Linux-Unix
]
pcl816
DL : 0
The driver support AI command mode, other subdevices not written.
Date
: 2026-01-10
Size
: 8kb
User
:
ctmonmer
[
Linux-Unix
]
pcl816
DL : 0
The driver support AI command mode, other subdevices not written.
Date
: 2026-01-10
Size
: 5kb
User
:
cuiconyk
[
Linux-Unix
]
HIVE1-2
DL : 0
Simple AI which can learn with spohisticated neurons
Date
: 2026-01-10
Size
: 4kb
User
:
akfjbsno qeoigub
[
Linux-Unix
]
ni_daq_700
DL : 0
Driver for DAQCard-700 DIO AI copied 8255. -Driver for DAQCard-700 DIO AI copied 8255.
Date
: 2026-01-10
Size
: 3kb
User
:
flwmding
[
Linux-Unix
]
12
DL : 0
编程实现清除线性表L=(a0,a1,---,ai,-------,an-1)中重复元素。(programing to realize cleaning the repeated elements in sequence sheet)
Date
: 2026-01-10
Size
: 9kb
User
:
DandingWQZ
[
Linux-Unix
]
ads1158-linux驱动.tar
DL : 3
ads1158芯片驱动,ai采样芯片,通信总线是spi总线,循环16通道采样(ads1158 linux driver ,spi bus)
Date
: 2026-01-10
Size
: 1.17mb
User
:
jnumountain
[
Linux-Unix
]
assignment1
DL : 5
Python codes for Machine Learning with AI. The compressed codes here is for 1st assignment which includes 6 questions.
Date
: 2026-01-10
Size
: 1.34mb
User
:
akichen7
[
Linux-Unix
]
fenpaifangan
DL : 0
Description cxt的扑克牌越来越先进了,这回牌面的点数还可以是负数, 这回cxt准备给扑克牌分组,他打算将所有的牌分成若干个堆,每堆的牌面总和和都要大于零。由于扑克牌是按顺序排列的,所以一堆牌在原牌堆里面必须是连续的。请帮助cxt计算一下,存在多少种不同的分牌的方案。由于答案可能很大,只要输出答案除以1,000,000,009的余数即可。 Input Format 第一行:单个整数:N,1 ≤ N ≤ 10^6 第二行到N + 1行:在第i + 1行有一个整数:Ai, 表示第i张牌牌面的值。 Output Format 第一行:单个整数,表示分组方案数除以1,000,000,009的余数(case to share the cards)
Date
: 2026-01-10
Size
: 3kb
User
:
赵益恺
«
1
2
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.