亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

Transition-Time

  • Newton Game Dynamic 1.52 Delphi下基于GLScene的OpenGL游戲開發控件。功能非常強大和易于使用。 Advanced physics engine for re

    Newton Game Dynamic 1.52 Delphi下基于GLScene的OpenGL游戲開發控件。功能非常強大和易于使用。 Advanced physics engine for real-time simulation of rigid bodies

    標簽: Advanced Dynamic GLScene physics

    上傳時間: 2014-01-18

    上傳用戶:chongcongying

  • What is Verilog? ➥ Verilog HDL is a Hardware Description Language (HDL) ➥ Verilog HDL

    What is Verilog? ➥ Verilog HDL is a Hardware Description Language (HDL) ➥ Verilog HDL allows describe designs at a high level of abstraction as well as the lower implementation levels ➥ Primary use of HDLs is the simulation of designs ➥ Verilog is a discrete event time simulator  What is VeriWell? ➥ VeriWell is a comprehensive implementation of Verilog HDL

    標簽: Verilog HDL 10149 Description

    上傳時間: 2017-02-18

    上傳用戶:

  • To review what a metaball is, and how to render them and to describe a new optimization I ve made

    To review what a metaball is, and how to render them and to describe a new optimization I ve made for rendering metaballs. For complex scenes, it can render hundreds of times faster, though I m certain others have discovered this trick as well. It does very slightly change the characteristic shape of the blobs, but there is no loss in image quality whatsoever. (I actually developed all this about two years ago, but just now felt like writing it all down, and had the time!)

    標簽: optimization and metaball describe

    上傳時間: 2013-12-27

    上傳用戶:彭玖華

  • Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than f

    Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)

    標簽: contains Output convex planar

    上傳時間: 2017-02-19

    上傳用戶:wyc199288

  • documentation for optimal filtering toolbox for mathematical software package Matlab. The methods i

    documentation for optimal filtering toolbox for mathematical software package Matlab. The methods in the toolbox include Kalman filter, extended Kalman filter and unscented Kalman filter for discrete time state space models. Also included in the toolbox are the Rauch-Tung-Striebel and Forward-Backward smoother counter-parts for each filter, which can be used to smooth the previous state estimates, after obtaining new measurements. The usage and function of each method are illustrated with five demonstrations problems. 1

    標簽: documentation mathematical for filtering

    上傳時間: 2014-01-20

    上傳用戶:changeboy

  • documentation for optimal filtering toolbox for mathematical software package Matlab. The methods i

    documentation for optimal filtering toolbox for mathematical software package Matlab. The methods in the toolbox include Kalman filter, extended Kalman filter and unscented Kalman filter for discrete time state space models. Also included in the toolbox are the Rauch-Tung-Striebel and Forward-Backward smoother counter-parts for each filter, which can be used to smooth the previous state estimates, after obtaining new measurements. The usage and function of each method are illustrated with five demonstrations problems. 1

    標簽: documentation mathematical for filtering

    上傳時間: 2013-12-10

    上傳用戶:zxc23456789

  • Have you ever seen players eyes light up as they explore the worlds that you ve created in your gam

    Have you ever seen players eyes light up as they explore the worlds that you ve created in your games? If you have, then game development probably has you hooked firmly in its grasp! If you ve never taken your games beyond the PC, now s the time! "J2ME Game Programming" is a hands-on guide that teaches you how to create games for micro-devices. You ll be amazed at just how cool the games you create can look and play. Focusing primarily on mobile phone game creation, you ll jump right in and create your own games as you work your way through the book. The thought has surely crossed your mind that it would be nice to make some money off of this cool hobby of yours. J2ME offers real opportunity to profit from your games. Learn how you can earn revenue from your games by taking them to market. If you have a basic understanding of Java, then you re ready to explore all that "J2ME Game Programming" has to offer!

    標簽: you created players explore

    上傳時間: 2017-02-25

    上傳用戶:lanhuaying

  • Custom Visual Basic Packager and Installer for Visual Basic Developers. This is a group of standard

    Custom Visual Basic Packager and Installer for Visual Basic Developers. This is a group of standard exe projects 1. Packager 2. Setup1 The packager works like Visual basic Application deployment Wizard. And the setup1 project is used for the installation of the package. This project demonstrates how to compile visual basic project without launching the Vb6 kit and retrieving the dependency Files of any Visual basic project (although roughly done without any specific algorithm), Somebody can help me with this. I don’ t have time for the project, so I don’ t want any comment on the code indentation or arrangement and variable scoping. Comments are in the code therefore it would not be a problem to understand the code. If anyone wants to vote, I will like it Oh! I found some of the setup1 code and modify it with new features, so i have no or less credit for the setup1 project I felt like sharing code with PSCites. Thats why I made it

    標簽: Visual Basic Developers Installer

    上傳時間: 2017-02-26

    上傳用戶:FreeSky

  • Easy implementation of PRIM and DIJKSTRA algorims for graph sorting. It also permit comparison of ti

    Easy implementation of PRIM and DIJKSTRA algorims for graph sorting. It also permit comparison of time betwen both algoritm.

    標簽: implementation comparison DIJKSTRA algorims

    上傳時間: 2013-12-29

    上傳用戶:王慶才

  • This is an implementation of double-array structure for representing trie, as proposed by Junichi A

    This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.

    標簽: implementation double-array representing structure

    上傳時間: 2013-12-10

    上傳用戶:shinesyh

主站蜘蛛池模板: 通道| 兴仁县| 通道| 平果县| 文成县| 丹巴县| 奉贤区| 太谷县| 元阳县| 长垣县| 玛多县| 黄山市| 宁强县| 阿勒泰市| 海阳市| 开原市| 天镇县| 洪雅县| 道真| 镇坪县| 栖霞市| 揭西县| 罗田县| 天峨县| 蒙阴县| 博客| 沾益县| 泰州市| 神木县| 泾川县| 泰兴市| 灵丘县| 土默特右旗| 辛集市| 烟台市| 丰原市| 自贡市| 上林县| 丘北县| 兴化市| 德惠市|