matlab最短路的貪心算法，用VC++實(shí)現(xiàn)，把ShortEst.dll復(fù)制到matlab工作文件夾運(yùn)行（先要運(yùn)行mex-setup，關(guān)聯(lián)VC與MATLAB）調(diào)用方法如 a = [-1,2,3 2,-1,4 3,4,-1] ShorstEst(a) 即可
上傳時(shí)間： 2013-12-10
上傳用戶：cxl274287265
This program sets up EVA Timer 1, EVA Timer 2, EVB Timer 3 and EVB Timer 4 to fire an interrupt on a period overflow. A count is kept each time each interrupt passes through the interrupt service routine. EVA Timer 1 has the shortest period while EVB Timer4 has the longest period.
標(biāo)簽： Timer EVA EVB interrupt
上傳時(shí)間： 2013-12-25
上傳用戶：康郎
C++圖論算法，dijistra shortest path， floyd shortest path等最短路算法
上傳時(shí)間： 2014-01-03
上傳用戶：笨小孩
迷宮算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */
標(biāo)簽： Starting point means maze
上傳時(shí)間： 2013-12-27
上傳用戶：Divine
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex
標(biāo)簽： nonnegative weight source vertex
上傳時(shí)間： 2014-01-10
上傳用戶：xuan‘nian
The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a graph from a le, where airports are represented as vertices and ights between airports are represented as edges, take as input two airports and calculate the shortest route (ie path) between them.
標(biāo)簽： system assignment implement airline
上傳時(shí)間： 2017-09-07
上傳用戶：kiklkook
這個(gè)說明倒不是說明函數(shù)的功能，只是聲明一下函數(shù)中出現(xiàn)的問題。 shortest()函數(shù)沒有問題，在secshortest中我希望只得到一條次短路（或幾條roadcost()值相同的次短路），結(jié)果卻出來好幾條，我仔細(xì)檢查了一下程序，應(yīng)該沒有什么問題。 因此在使用時(shí)，要得到次短路，只能用roadcost()函數(shù)分別求一下各條路的權(quán)重和，找到最小的。 有些奇怪
標(biāo)簽： 函數(shù)
上傳時(shí)間： 2014-01-07
上傳用戶：lijianyu172
Program helping you to remember the route. It cab be route from conference room to coffee-room, it can be tourist trip, it can be pathway in labyrinth. during first traversal you make notes in you phone, specifying direction of movement and target of each step. Phone remembers how much time each steps takes. Then you can just inspect information about this trip and check duration of each stage and the whole trip. You can also replay it in forward and backward direction. So if somebody show you the shortest way to coffee machine, you can easily find the way back and can repeat this trip in future.
標(biāo)簽： route coffee-room conference remember
上傳時(shí)間： 2014-01-05
上傳用戶：1159797854
matlab有限元網(wǎng)格劃分程序 DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
標(biāo)簽： matlab有限元網(wǎng)格劃分程序
上傳時(shí)間： 2015-08-12
上傳用戶：凜風(fēng)拂衣袖
In order to improve the spectral efficiency in wireless communications, multiple antennas are employed at both transmitter and receiver sides, where the resulting system is referred to as the multiple-input multiple-output (MIMO) system. In MIMO systems, it is usually requiredto detect signals jointly as multiple signals are transmitted through multiple signal paths between the transmitter and the receiver. This joint detection becomes the MIMO detection.
標(biāo)簽： Complexity Detection MIMO Low
上傳時(shí)間： 2020-05-27
上傳用戶：shancjb
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
