搜索结果
找到约 21 项符合
paths 的查询结果
按分类筛选
行业发展研究 Each arc of a binary-state network has good/bad states. The system reliability, the probability tha
Each arc of a binary-state network has good/bad states. The system reliability, the probability
that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An
MP is an ordered sequence of arcs from s to t that has no cycle. Note that a minimal path is
different from the ...
单片机开发 1 安装：首先安装MPLAB IDE V7.42的程序
1 安装：首先安装MPLAB IDE V7.42的程序，然后再安装C的组件PICC8.05-PL.安装过程中全部确认选择，完毕后重启计算机。
2 激活：(PICC8.05-PL)
运行“开始”菜单下的“HI-TECH SOFTWARE”中的 激活（Complier Activation）程序，
再同时启动算号器程序（HtkeyGen.exe）,将Last Name前的勾去掉，填入公司名称，算出相应内
...
网络 最受欢迎的Joomla社区用户管理收费插件 - Commnity Builder 1.2 RC2。 Community Builder suite (CB) extends the Joomla!
最受欢迎的Joomla社区用户管理收费插件 - Commnity Builder 1.2 RC2。
Community Builder suite (CB) extends the Joomla! user management system. Key features: extra fields in profile, enhanced registration workflows, user lists, connection paths between users, admin defined tabs and user profiles, image u ...
软件设计/软件工程 最受欢迎的Joomla 社区用户管理收费插件 Community Builder 1.2 RC2 的电子书
最受欢迎的Joomla 社区用户管理收费插件 Community Builder 1.2 RC2 的电子书，仅提供给付费会员
Community Builder suite (CB) extends the Joomla! user management system. Key features: extra fields in profile, enhanced registration workflows, user lists, connection paths between users, admin defined tabs a ...
Java编程 December 19, 2006 - Ant 1.7.0 Available Apache Ant 1.7.0 is now available for download. Ant 1.7
December 19, 2006 - Ant 1.7.0 Available
Apache Ant 1.7.0 is now available for download.
Ant 1.7 introduces a resource framework. Some of the core ant tasks such as <copy/> are now able to process not only file system resources but also zip entries, tar entries, paths, ... Resource collections group ...
uCOS 移植ucos2.76到mega128中软件仿真成功。 需要在iccavr7.13中编译
移植ucos2.76到mega128中软件仿真成功。 需要在iccavr7.13中编译，软件仿真AVR Studio 4.12。下载后将其解压到d下编译，否则可能要修改iccavr 的环境变量。就是菜单project下的Options选择paths进行设置。
其他 In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out ...
通讯编程文档 Because WDM networks are circuit switched loss networks blocking may occur because of lack of resour
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on eac ...
数据结构 There are many algorithms that can be applied to graphs. Many of these are actually used in the real
There are many algorithms that can be applied to graphs. Many of these are actually used in the real world,
such as Dijkstra’s algorithm to find shortest paths. We will discuss a few here.
书籍 Low Complexity MIMO Detection
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 joint ...