bound
共 19 篇文章
bound 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 19 篇文章，持续更新中。
Cadence-Allegro元件封装制作流程.
<p>一个元件封装的制作过程如下图所示。简单来说，首先用户需要制作自己的焊盘库Pads，包括普通焊盘形状Shape Symbol和花焊盘形状Flash Symbol；然后根据元件的引脚Pins选择合适的焊盘；接着选择合适的位置放置焊盘，再放置封装各层的外形（如Assembly_Top、silkscreen Top、Place Bound Top等），添加各层的标示符Labels，还可以设定元件的高
作業系統RR排程方法,使用c程式來表示cpu bound & io bound (學校作業)
作業系統RR排程方法,使用c程式來表示cpu bound & io bound (學校作業)
Written for engineering and computer science students and practicing engineers, this book provides t
Written for engineering and computer science students and practicing engineers, this book provides the fundamental applications and mathematical techniques of signal processing. Topics covered include
SCSI Multimedia Commands 鈥?3 (MMC-3) T10/1363-D 5.16 READ CAPACITY Command The READ CAPACITY comm
SCSI Multimedia Commands 鈥?3 (MMC-3)
T10/1363-D
5.16 READ CAPACITY Command
The READ CAPACITY command (Table 144) provides a means for the Initiator to request information
regarding the capacity of
3DBPP BRANCH AND BOUND
3DBPP BRANCH AND BOUND
The basic principle using the branchand- bound strategy to solve the traveling salesperson optimiz
The basic principle using the branchand-
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
􀂄 There is a way to split the solution space.
bound-constrained SVM
bound-constrained SVM
This paper examines the asymptotic (large sample) performance of a family of non-data aided feedfor
This paper examines the asymptotic (large sample) performance
of a family of non-data aided feedforward (NDA FF) nonlinear
least-squares (NLS) type carrier frequency estimators for burst-mode
phase
This my phd thesis for the WDM optical network optimization, which employs convex optimization techn
This my phd thesis for the WDM optical network optimization, which employs convex optimization techniques to solve the proposed integer problems. The computation complexity of my optimization framewor
这是sun公司的程序员考试书籍（英文版的pdf） 还有模拟考试安装盘
这是sun公司的程序员考试书籍（英文版的pdf）
还有模拟考试安装盘，和视频！我将稍后发布！
READ THIS AGREEMENT CAREFULLY. IF YOU AGREE TO ALL THE TERMS AND CONDITIONS SET FORTH BELOW AND ARE WILLING TO BE LEGALLY BOUND BY THEM, PRESS THE I AG
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA)
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows,
輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) R
輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括
1) base C++ review,
2) Pointers and Dynamic Objects,
3) Recursion,Linked Lists,
4) Stacks and Queues,
5) Algorithm Analysis,
6) Insertion Sort and Mergeso
A branch-and-bound algorithm for asymmetric TSP
A branch-and-bound algorithm for asymmetric TSP
BY USING THIS SOFTWARE, YOU ARE AGREEING TO BE BOUND BY THE TERMS OF * THIS AGREEMENT. DO NOT USE
BY USING THIS SOFTWARE, YOU ARE AGREEING TO BE BOUND BY THE TERMS OF
* THIS AGREEMENT. DO NOT USE THE SOFTWARE UNTIL YOU HAVE CAREFULLY
* READ AND AGREED TO THE FOLLOWING TERMS AND CONDITIONS.
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two
Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting
很全的中断手册。 INT 00 - CPU-generated - DIVIDE ERROR INT 01 - CPU-generated - SINGLE STEP (80386+) - DEB
很全的中断手册。
INT 00 - CPU-generated - DIVIDE ERROR
INT 01 - CPU-generated - SINGLE STEP (80386+) - DEBUGGING EXCEPTIONS
INT 02 - external hardware - NON-MASKABLE INTERRUPT
INT 03 - CPU-generated - BRE
Algoritm branch and bound and shortest path in C
Algoritm branch and bound and shortest path in C
Solving the TSP problem using the Branch and Bound Algorithm
Solving the TSP problem using the Branch and Bound Algorithm
用FPGA实现了RS232异步串行通信
用FPGA实现了RS232异步串行通信，所用语言是VHDL，另外本人还有Verilog的欢迎交流学习，根据RS232 异步串行通信来的帧格式，在FPGA发送模块中采用的每一帧格式为：1位开始位+8位数据位+1位奇校验位+1位停止位，波特率为2400。由设置的波特率可以算出分频系数，具体算法为分频系数X=CLK/(BOUND*2)。