搜索资源列表
yujianchengxu
- 自编程序，主要用于驾驶中眼睛的定位，用matlab实现。-written procedures, mainly for driving the eye position, using Matlab to achieve.
eye_code
- eye detection sample in matlab. Eyetrackers can analyze a driver’s level of attentiveness while driving and prevent drowsiness from causing accidents.-eye detection sample in Matlab. Eyetracke rs can analyze a driver's level of attentivenes s whi
pso_Methods_for_Pattern_Recognition_and_Image_Proc
- A dissipative particle swarm optimization is developed according to the self-organization of dissipative structure. The negative entropy is introduced to construct an opening dissipative system that is far-from-equilibrium so as to driving th
dijkstra
- dijkstra算法的matlab实现，验证数据采用了河北省主要城市的赋值无权网络图，并分析了单程往复式行驶的效率因素，实际应用价值高-the dijkstra algorithm matlab to achieve, verify the data used in major cities in Hebei Province network has no right of assignment, and an analysis of the efficiency of one-way reci
v32-57
- Analysis on Modeling and Simulink of DC Motor and its Driving System Used for Wheeled Mobile Robot
gai
- 汽车直线行驶工况分析，simulink模型，可自行修改参数-Automotive straight driving cycle analysis, simulink model, free to modify the parameters of
jiayouzhanwenti
- 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to
EigenfaceCore
- emotion recognition for driver facial emotional state while driving
qichejiayou
- 一辆汽车加满油后可行驶n公里，旅途中有若干个加油站，设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少，对于给定的n和k个加油站位置，编程计算最少加油次数。 可以利用贪心选择性质来求解汽车加油问题，也就是所求问题的整体最优解可以通过一系列局部最优的选择，即贪心选择来达到。这是贪心选择算法可行的第一个基本要素，也是贪心算法与动态规划算法的主要区别。在动态规划算法中，每步所做的选择往往信赖于相关子问题的解，因而只有在解出相关子问题后，才能做出选择。而在贪心算法中仅在当前状态下做出最
AVR_PCB_RS232
- cdm lamp driving program cermaic lamp power management.
Supportvectormachinebasedbatterymodelforelectricve
- The support vector machine (SVM) is a novel type of learning machine based on statistical learning theory that can map a nonlinear function successfully. As a battery is a nonlinear system, it is difficult to establish the relationship between th
pf
- We are researching robot localization techniques which fuse dead reckoning measurements with range measurements from stationary radio beacons in the robot s environment. This site provides Matlab code for three algorithms explored thus far -- an
Example_4_DriveUntilWall
- Example of solution of the problem of robot driving along the wa-Example of solution of the problem of robot driving along the wall
WFS
- Computes WFS driving functions of a wfs-system, based on the 212 D Rayleigh I-Integral
biomedicalsignal
- 有关生物信号在检测驾驶疲劳方面的应用，中英文都有。希望对大家有所帮助。-biological signal in the test driving fatigue applications both in English and Chinese.EEG,EMG and ECG
WFSsaas
- Computes WFS driving functions of a wfs-system, based on the 212 D Rayleigh I-Integral
delandgain
- computing the driving functions (delay and gain) for loudspeaker -computing the driving functions (delay and gain) for loudspeaker
DrivingFunctionswfs
- Computes driving functions..hope you like it
car
- 给定一个N*N 的方形网格，设其左上角为起点◎，坐标为（1，1），X 轴向右为正，Y 轴向下为正，每个方格边长为1。一辆汽车从起点◎出发驶向右下角终点▲，其坐标为（N， N）。在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则： 求汽车从起点出发到达终点的一条所付费用最少的行驶路线。-Given an N* N square grid, set the upper left corner as a starting point ◎, c
dist
- 开车从起始点Ａ到目的地Ｂ的路线有多条。给你一张描述待选路线的表（n*n的矩阵A），让你找出行车距离最短的路线。表中表示了任意两个路口的连通情况，以及距离。矩阵元素a(i,j)=0表示路口i,j不连通，a(i,j)!=0表示路口i,j的行车距离。其中起始点Ａ在路口1，目的地Ｂ在路口n 。完成源程序DIST.CPP中Dijkstra函数的编写。-A drive to the destination from a starting point a number of B' s line. Giv