discipline of physics : advices : Asked : communication engineering : facial : Sherlock Kenan : Dragon and Underground City : enterprise network station > comb
Contents
No. 1
  Look carefully; Search: search forward | Search enemy remnants.
Translated by Google
No. 2
  Search; search. "Outside the reserve, said Han Fei lower left": "Chen Lu home, three trees are all Yoshitada; and Fu punished for a crime in Lu, were searching in the tiger." Nan Liu Yiqing Song "Shi conduct of public affairs": "Xie hours, soldiers flee account, easier, except a lower, almost channeling in various fang; or desire a time search, thank the public not allowed. "Ming Hu Ying-lin" Poetry Tau Six ":" probably the Six scribe, search Yan title, 1:00 boudoir rumors Zhe-shaped paper mulberry ink. "Xu arms" West Line anecdotes "8:" trees in the tree in search for a long time, found nothing. "
Translated by Google
No. 3
  Between Maung; follow appearance. "Selected Works of Wang Bao <Xiao Fu" ":" mysterious ape tragic tsunami, the search almost the meantime. "Annotation:" search, between appearance. "Tang Li Bai," free wangwu Recluses Wei Wan also wangwu "Poetry:" Song sound of wind and apes, search with Dong He. "Ming Liu base" to send Hu Ji Affairs Pingjiang prisons "Poetry:" once Qingmiao for court music, search the stream of Ben hanging work. "
Translated by Google
No. 4
  Search: carefully looking for. "Zuo hidden public five years" "it found the spring," Jin Du Yu Note: The "search will pick Infertility."
Translated by Google
[Words] Search
  Pinyin: sōu suǒ
  Explanation: a close look; Search: Search Forward | search Candi.
  1 seek; search.
  "Outside the reserve, said Han Fei left": "Lu Chen home, three trees are all Yoshitada; punished for a crime in Lu and Fu, are also searching for the tiger."
  Southern Song Liu Yiqing "Shi conduct of public affairs": "thank the public, the soldiers servant flee, flee, almost all under the Fang in Nantang; or desire to search for a moment, thank the public not allowed."
  Ming Hu Ying-lin "Poetry Tau Six": "Six scholars probably, Yan title search, and sometimes boudoir rumors, mulberry-shaped Noir ink."
  Xu arms "Western anecdotes" 8: "trees in the tree where the search for a long time, found nothing."
  2 between the appearance; follow appearance.
  "_Select_ed Works of Wang Bao <Xiao Fu>": "Xiao Xuan ape sad, almost during the search." Shan Note: "Search, between appearance."
  Tang Li Bai "Hermit Wei Wan also send wangwu Wangwu" Poetry: "sound of wind in the pines and the ape, the search even Donghe."
  Ming Liu Ji, "free huj Affairs Pingjiang wards' poem:" Once Qing Miao for Gagaku, search ran down the stream of work. "
Translated by Google
[Internet] search
  Search also known as search engine. Search engines (search engines) is the Internet's information resources collected, and then query the system for you, which includes information gathering, information collation and user queries of three parts.
  Popular search engines:
  Baidu, Google (Google), Yahoo, proper way, in the search, Sohu, search, search-off
  Is a search engine for your information "retrieval" service website, which use certain programs on the Internet all the information Guilei to help people in the vast network to the sea in search for the information they need.
  Early in the search engine is the Internet address of the server resources collected, provided by different types of resources into a different directory, then a layer classification. People can find the information you want into the layers of their classification, will be able to finally reach the destination, find the information you want. This is the most primitive way, only applies to Internet information is not much time. With the Internet, according to the geometric growth of information, and a true sense of the search engines, these search engines know that the beginning of each page on the website, then search the Internet all the hyperlinks, the hyperlinks on behalf of all the words into a database . This is now a prototype search engine.
  With yahoo! The emergence of search engine development has entered a golden age, its performance is more superior than before. Now search engines have not only the simple search page of information, and they have become more integrated, perfect since. To search engine Quanwei yahoo!, For example, from March 1995 by the Chinese-American Jerry Yang, who founded yahoo! Beginning to now, they from a single search engine developed to have e-commerce, news and information services, personal free e-mail Service and other network services, fully illustrated from a single search engine to the development of an integrated process.
  However, due to the search engines work and the rapid development of the Internet, making it more and more people are not satisfied with the search results. For example, search for "computer" term, it may be hundreds of millions of pages of results. This is because the site through search engines to optimize the relevance of search results, this correlation is again the location of keywords on the site, the site's name, labels the formula to decide. This is the search engine results are many and complex reasons. The search engine's database development and change because the Internet is bound to contain a dead link.
  In Baidu, Google, Yahoo and other major search engines become more mature than, different types of search Daquan also the gradual rise of the Internet today. Search Daquan is _set_ different types of search engines, covering multi-language search in a collection. The rise of the corpus of such search engine, the search easier. Almost all of the content can be in the "between a" complete. Google hundred degrees such as rage, such as the newly out sou1sou so that other search engines will result in a collection.
  Search the principle:
  1, scrape the Web
  Each individual has its own web search engine crawler (spider). Spider web pages along hyperlinks continuously crawl the page. Hyperlinks in the application of the Internet is widespread, in theory, starting from a range of pages, you can collect the vast majority of web pages.
  2, dealing with Web
  Web search engines caught, they still do a lot of preprocessing, in order to provide search services. The most important thing is to extract keywords, indexing files. Other also includes the removal of duplicate pages, hyperlink analysis, calculate page importance degree.
  3, providing access to services
  The user to enter keyword search, the search engine found in the database from the index page matches the keywords; to the user ease of judgments, in addition to page title and URL, it will also provide a summary from the website and other information.
  Teach you how to accurately search
  If you want to find a local area on the internet thing or information, you can then search google or baidu or other device, enter: the name of a certain product name or information and then use a comma "," and then enter the location of the city name, click search, so a lot about a city-related products or information on there. For example: certain products, city name; or a certain data names, city names.
Translated by Google
Encyclopedia
  sousuo
  Search
  search
  The process of looking for the solution of the problem or technology, artificial intelligence problem solving is the basic method.
  Search space and problem solving in the search graph in the search space, including all non-state space and state space. Search process inside the computer to form part of the actual search space is called the search graph. The purpose of the search is to use the search map as small as possible to find the solution of the problem.
  In the problem solving system, the problem that there are two basic approaches: state space representation and problem-reduction representation. In state space representation, the state space of the node that state, that is the problem solving process at different stages, there are between two nodes represents the state transition to the arc. Reduction in problem representation, the original problem is decomposed into several sub-problems, these problems are further sub-divided into a number of lower-level sub-problems, there is the arc between nodes represents the problem of reduction, so the formation of problem reduction space. The problem space and state space reduction are different types of search space.
  Search space for general use graph. In practical problems, sometimes the search space is infinite (eg, theorem proving the case). In the chess game, although the search space is limited, but some chess chess game of its total up to 10120 different. Therefore, the entire search space with the corresponding map (called implicit figure) all come out explicitly that neither possible nor necessary. Usually only part of the search space with the corresponding sub-graph graph implied, that the search graph explicitly represented.
  Limit the search to be in a reasonable amount of search time and computer storage conditions to complete. Of complex practical problems, exhaustive search is difficult to achieve. For example, a chess game to list all possible moves, then the search space with nodes will step into the exponential growth in the number of □, a phenomenon known as the index of the explosion. Limit the amount of the basic way to search is to improve the problem representation, heuristic search, the introduction of problem-solving and other techniques, such as action plans.
  No information search in the search process if you do not use heuristic information related to problem areas, this search is called non-information search, or blind-type search. For example, the search tree node can be expanded in order to be classified. The so-called extension of a node, the node refers to all subsequent nodes all calculated. Breadth-first search is the starting node by node and the level of seniority to expand away from the node, which means that all the operators □ length sequence analysis is completed before the length of □ +1 regardless of the operator sequence. If the solution of the problem exists, with breadth-first search strategy is expected to be the shortest operator sequence, that is solving the shortest path. Depth-first search is characterized by expansion of the latest generation of the first or the deepest node until the node has no expanded or search depth has reached the specified limit. Then return to the nearest branch, to continue the search. Although no information search method is simple, but inefficient, it is difficult to directly solve complex practical problems.
  Heuristic search for a knowledge and experience to rely on intuitive search method. If used properly, can greatly reduce the search effort. However, heuristic search does not guarantee the optimal solution, even problems not necessarily guaranteed a solution. Practice shows that if the problem a solution, a good heuristic search method in most cases can give satisfactory results. The basic use of heuristic search methods as follows: ① decide on the next node to expand (not mechanically follow the breadth-first or depth-first method), ordered the search or best-first search called on to follow this approach. Each time you _select_ the most promising nodes first expansion. In order to "have hope" to measure the extent of the need to establish evaluation function. "There is hope," the meaning and the corresponding evaluation function of the specific nature of the problem depends entirely on the structure and requirements. Here are the two factors need to weigh the simplicity of the solution (the problem-solving path search graph takes the number of nodes and arcs to minimum) and the size of the search effort. For the ordered state space search, in accordance with the purpose of solving the minimum cost path established □ * algorithm and the corresponding evaluation function. Such □ * Branch and Bound algorithm also in the name of the method is widely used in operations research. ② In the expansion of nodes to determine which one or which generate some of the first successor node, instead of blindly generating all successor nodes at the same time, many game programs to follow this approach, such as tree search strategies. ③ decided that some nodes will not start the search tree should be cut off. The reason may be cut off because the start of the node to find the problem-solving pathway plays a minor role, it could be for other
Translated by Google
English Expression
  1. n.:  hunt after,  hunt for,  shakedown,  search,  scout,  ferret for,  hunt about for,  reconnaissance,  recce,  quest,  manhunt,  hunting,  hunt,  nose after[for]
  2. v.:  rake,  rootle,  searching,  seek,  grabble
  3. vt.:  scan,  sought,  scour,  reconnoiter
  4. vi.:  comb,  ferret
French Expression
  1. v.  faire des fouilles, rechercher
Thesaurus
quest
Related Phrases
Softwarenetworkregulate
Baiduhard diskBaidu at a burst
huangyecropthe study of the (Chinese) national classics
shopthrow eyes atsearch engine
apeak combcopy search engineMore results...
Containing Phrases
combferret