44 results about "Pareto local search" patented technology

A system may identify a first document associated with a geographic location within a geographical area and identify a second document associated with a geographic location outside the geographical area. The system may also assign a first score to the first document based on a first scoring function and assign a second score to the second document based on a second scoring function.

Video or media content is transferred to a local video or media server by a system administrator or central content programmer. Client data processing modules, i.e., client machines, are configured to query for local content associated with a particular file and stream names. The local search replaces the original stream name with a stream name associated with a local area network. The modified configuration file of the client machines provisionally substitutes a local stream name for the original stream name linked to the central media server. If a local query script searching for selected content locally, results in an error response indicating the requested content is unavailable locally, then the provisional stream name is deleted and replaced with the original stream name. The original stream request for selected content, which was made to the central media or video server is accordingly implemented as a fallback.

Computer-implemented methods and systems for processing user entered query data to improve results of a search of pages using a local search database are provided, when searching the internet. The method includes receiving the user entered query data and parsing each word of the query data and examining each word to determine if the word is associated with one of a business name, a city name or a state name. The examining uses probabilistic dictionaries to determine a likelihood that the word is one of the business name, the city name or the state name. Then, associating the words that were determined to be: (i) the business name with a business name tag to create one or more tagged business terms; (ii) the city name with a city name tag to create one or more tagged city terms; and (iii) the state name with a state name tag to create one or more tagged state terms. The method further includes normalizing each of the tagged business terms, the tagged city terms and the tagged state terms. The normalizing includes boosting information if found in the local search database and determining proximity between selected ones of the tagged business, city or state terms. Then, generating an optimized internal search query that incorporates constraints and ranking based on at least the boosting information and the determined proximity between the selected tagged business, city or state terms. The optimized internal search query is applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.

Systems and methods are disclosed for improving search results returned to a user from one or more domains, utilizing query features learned locally on the user's device. One or more domains can inform a computing device of one or more features related to a search query upon which to the computing device can apply local learning. A local search system can include a local database, a local search history and feedback history database, and a local learning system to identify features about query terms. The features can be learned from the user's interaction with both local search results and remote search results, without sending the user interaction information or other user identification information to a remote search engine. A locally learned feature can be used to extend a query, bias a query term, or filter query results.

Embodiments described herein are directed to providing local search engines over large databases. In one scenario, a computing system receives as inputs data records stored in a database. The computing parses the data records into file pairs that each include a keyword file and record ID file and merges file pairs into a keyword file and record ID file, where the keyword file includes keywords in sorted order, and where the record ID file includes a list of record IDs for keywords in the keyword file. The computing system further creates an offset file which stores offset values for starting addresses of record ID lists in the record ID file, and generates an index of keywords by assigning unique identifiers to keywords in the keyword file. The computing system also provides a query interface that allows the database's data records to be searched using the generated index of keywords.

The invention provides a flexible job shop scheduling method and system based on a hybrid evolutionary algorithm, and the method comprises the steps: constructing a multi-time-constrained flexible job shop scheduling model based on setting time and processing time, and setting constraint conditions; carrying out segmented integer coding and decoding operation on a machine selection part and a process arrangement part for workpiece processing; performing initialization processing on the population of the hybrid evolutionary algorithm to obtain a parent population; performing crossover operation and mutation operation on the parent population based on the neighborhood to obtain a first population, and performing local search on the parent population based on the neighborhood to obtain a second population; performing elite retention operation on the first population and the second population to obtain an elite population; and when the hybrid evolutionary algorithm meets an iteration termination condition, solving the flexible job shop scheduling model according to the elite population, and scheduling the flexible job shop. The scheduling problem is solved by adopting an intelligent algorithm, so that the workshop can be helped to find an optimal scheduling mode, and the production efficiency is effectively improved.

The invention relates to a large-scale contact list, which belongs to the technical field of contact lists. The respective contact information of clients is uploaded, all the provided information is stored in one or more servers, and the provided information can be downloaded by direct Web search or according to need and then searched locally when a client needs to be contacted. For the contacted party, the information of the other party is directly displayed on a communication device in the process of communication, so the telephone number does not need to be manually entered. Users only need to change respective information on the servers via client ends. In the large-scale contact list, exchanging contact information between people is changed into uploading or publishing respective contact information, and the contact information of all users can be completely or partially searched or published according to the permission of related rules or legal provisions. The large-scale contact list can be conveniently used by people, moreover, the inconvenience caused by the loss of contact lists can be prevented, the optimal contact methods of people in work can be enriched, people can better contact one another, and the living standard of people can be increased.

The invention discloses a vehicle-unmanned aerial vehicle multi-target cooperative path planning method. The method comprises the following steps: acquiring a set of all client points and the number of unmanned aerial vehicles; generating an initial population, a set PF and a probability parameter; starting iterative optimization: in each iteration, generating a filial generation population based on a genetic operator, and combining the filial generation population with a parent population; combining repeated solutions in the population by using a disturbance strategy; executing non-dominated sorting; updating the Pareto frontier, performing Pareto local search on the solution in the PF, and replacing the Pareto frontier with the searched PF; executing crowding degree calculation and a squeezing strategy; selecting a proper solution to enter a next generation population; carrying out iteration until a final Pareto front is returned; and sending the path planning scheme to the vehicle and the unmanned aerial vehicle. Experimental results prove that the method has performance superiority and parameter sensitivity. A method for searching an optimal compromise scheme is provided for decision making of logistics enterprises.