搜索结果

In the last decade the processing of polygonal meshes has emerged as an active and very productive research area. This can basically be attributed to two developments:  Modern geometry acquisition devices, like laser scanners and MRT, easily produce raw polygonal meshes of ever growing complexity  D ...

The most straightforward approximation is the standard Gaussian approximation, where the MAI is approximated by a Gaussian random variable. This approximation is simple, however it is not accurate in general. In situations where the number of users is not large, the Gaussian approximation is not app ...

Please read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory.

Novell.Press.Linux.Kernel.Development linux内核开发的经典书籍之一 The Linux kernel is one of the most interesting yet least understood open-source projects. It is also a basis for developing new kernel code. That is why Sams is excited to bring you the latest Linux kernel development information fro ...

Please read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory.

C in A Nutshell Learning a language--any language--involves a process wherein you learn to rely less and less on instruction and more increasingly on the aspects of the language you ve mastered. Whether you re learning French, Java, or C, at some point you ll set aside the tutorial and attempt to co ...

迷宫算法（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 prog ...

This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum pre-defined torque, without collision with any obstacle in the r ...

编译课上做的小程序，用四种分析方法分别实现（LL1,算符优先，递归下降，简单词法分析） 完成对正则文法所描述的Pascal语言子集单词符号的词法分析程序。 <标识符>→字母︱ <标识符>字母︱ <标识符>数字 <无符号整数>→数字︱ <无符号整数>数字 <单字符分界符> →+ ︱－ ︱* ︱ ︱(︱) <双字符分界符>→<大于 ...

Please read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory.