Notch feature recognition based on chain description;
基于环搜索的盲台阶类特征识别
Based on that, putting forward two sorts of best solutions-circulating search method and differentical iterative way ,which do not depend on functional derivatives.
在此基础上提出非线性函数空间目标函数的最优算法 ,即基于差分理论的迭代算法及多维轮环搜索法 ,这些算法均不依赖函数导数 。
Open-loop Search the Gain and Phase Balance Between the Two Amplifier Branches in LINC System
开环搜索LINC中两路增益和相位平衡点
Implementing Fast Searching and Selective Backtracking in LP Environments
LP环境下快速搜索与选择回溯的实现
Ontology-based Search Engine under P2P Environment;
P2P环境下基于Ontology的搜索引擎
Multimedia Search Engine Design Based on Grid Enviroment;
基于网格环境的多媒体搜索引擎设计
Research on k-nearest NeighBor Search Algorithm in P2P
P2P环境中k最近邻搜索算法研究
When most people talk about Internet search engines, they really mean World Wide Web search engines.
当许多人谈起因特网搜索引擎时实际上指的都是环球网搜索引擎。
search engine
搜索器,搜索引擎,[台]搜寻器,搜寻引擎
Intelligent Search Technology of Network Environment Information System;
网络环境下信息系统中的智能搜索技术
Implementation of the Search Engine in Web Courseware Environment Based on XML;
基于XML的网络课件环境中搜索引擎的实现
Methods and Techniques of How to Employ Search Engineers in Network;
网络环境下搜索引擎的使用方法与技巧
Environment Information Coherence in Multi-UAVs Cooperative Area Searching
多UAV协同区域搜索中的环境信息一致性研究
RESEARCH ON AUTO-SEARCHING LEAST CLOSED LOOPS IN CONTROL NETWORK
控制网最小独立闭合环自动搜索算法研究
Research of Ontology-based P2P Resource Search Methods
P2P环境下基于本体的资源搜索技术研究
A quick method to search least independent close loops and annexed lines
最短独立闭合环与附合路线的快速搜索方法
Fast Search Algorithm Based on the Minimum First Difference Chain Code
基于最小首差循环链码的快速搜索算法
The Multi-faceted Result and Diversity of Ways to Get the Information Base on the Environment of Web 2.0--An Instance From the Search Platform of Duxiu
Web2.0环境下的多面搜索与获取信息途径的多样性分析——以读秀学术搜索为例
SEARCH: Both full-text search engines and ones that search descriptions of documents and other content.
搜索层:全文搜索引擎和搜索文档描述和其他内容的搜索引擎。
AutoCAD library search path
AutoCAD库搜索路径
CopyRight © 2020-2024 优校网[www.youxiaow.com]版权所有 All Rights Reserved. ICP备案号:浙ICP备2024058711号