52 results about "Combinatorial search" patented technology

A method of providing a search engine for use on global computer networks which identifies and merges categories of information that reflect, influence and imitate intelligent choice by concurrently searching one or more of eight factors of consumer trust: books, experts, news and articles, associations, celebrities and pro choice, awards, web information and blogs and people's choice. The results from the search of these selected consumer trust factors are then combined to generate a final report.

A system and method for the discovery and selection of an optimal probability model. Probability model selection can be formulated as an optimization problem with linear order constraints and a non-linear objective function. In one aspect, an algorithm that employs an information-theoretic based approach is used in which a scalable combinatoric search is utilized as defined by an initial solution and null vectors. The theoretical development of the algorithm has led to a property that can be interpreted semantically as the weight of evidence in information theory.

Markdown optimization may be performed using a computer system. Markdown objectives may include margin maximization or inventor minimization. Markdown schedule optimization uses an efficient, iterative, targeted combinatorial search. First, permissible discount steps are identified, then for each permissible discount step, a subspace of permissible step dates is identified. Elements from the date step subspace and price reduction subspace are combined and evaluated against the markdown objectives. If an improved markdown schedule is located, a new subspace of permissible step dates is defined to search the subregion of the solution space where the improved markdown optimization schedule was identified. Scheduling of inventory allocation from a distribution center is also disclosed.

Methods, systems and program storage devices for generating search engine search results. Online files relevant to a requested search query are located by a search engine, while simultaneously previously accessed offline files residing on a client computer are located using the same search query. The search engine retrieves the offline files from the client computer and combines such offline files with the locate online files in a single search result overview. The listing of files within the combined search results are ranked according to relevancy to the search query using a search engine scoring algorithm, whereby the offline files within the combined search results are preferably brought to a user's attention to indicate that such files reside on the client computer.

A method of and system for ranking users by reputation enables better searching for a service provider. Service providers are also forced to conform to reputation requirements since they are published. The reputation requirements include reviews, earnings, duration on a site, recent visits and other components that are able to establish a user's reputation. The components are also weighted so that more important factors count more towards a user's reputation. By combining a search score and a reputation score, a total score is determined which is used to generate a list of results ordered based on the total score.

A system and method that that interactively provides search previews to users from one or more data sources is provided. In addition, the user interactively combines searches using a drag and drop interface and receive previews of the combined searches. A palate of graphical objects (icons) are displayed to the user. Each of the graphical objects corresponds to a different database search. The user selects one or more of the graphical objects and drags them to a data source representation, such as a data source window. In response to the user's action, a preview request is created and sent to the data source. The user's computer then receives the preview results from the data source and the preview results are displayed to the user.

Disclosed herein are optimal or near optimal algorithms implemented as software tools that will allow the user/machine to identify optimal media out of the job set automatically. There are at least two main process steps to the exemplary embodiment. The first step involves the off-line characterization of the printing/image rendering system that will be used to extract the principal basis vectors from the experimental data. The second step involves the run-time mode, in which the pre-characterized basis vectors are used in conjunction with an optimal algorithm that will identify the media for re-calibration/re-characterization from the group of media set that the customer is interested to print. The optimal algorithm performs the combinatorial search every time the customer wishes to select the media. Once the optimal media is selected, the customer or the machine can print color patches (which are also optimal set) and execute the rest of the processing to reconstruct the best color management LUTs.

A search technique having enhanced ease-of-use is provided. A search server analyzes web contents, extracts index information (e.g., time, geographical name, personal name, and business type), and registers the index information in an index information database. A time information search unit performs search using time as a key, a geographical name information search unit performs search using a geographical name as a key, a personal name information search unit performs search using a personal name as a key, a business type information search unit performs search using a business type as a key, and a topic information search unit performs search using a topic as a key. In order to perform narrowing down search while using these search engines integrally, a federated search unit provides a user interface to specify combined search conditions for the search engines.

A customized, specialty-oriented database and index. of a subject matter area and methods for constructing and using such a database are provided. Selection and indexing of articles is done by experts in the specialty with which the database is concerned. A thesaurus allows indexing and search in accordance with terminology familiar to different anticipated groups of users (e.g. doctors, patients, nurses, technicians, and the like) by translating search terms to a standard and limited list of topics; a limited number of which are assigned to each document/article and allowing the topics most likely to be relevant to be found. The search can be conducted based on the most relevant topic found or sequential searches can be performed based on topics most relevant to individual search terms or combined search terms and the search results combined on the basis of common topic classifications to leverage the benefits of document classification.

The invention discloses a train beat type running optimization method based on the multi-path combinatorial search. The method comprises the steps that the combination of all train travel time of the minimum beat unit is taken as the optimization target, an optimization model of the train beat type running time table is built, and a weighted diagraph of describing the train running is built; then based on the diagraph, the combination of the directed arc weights passed by all the trains in the diagraph of the minimum beat unit is used as the optimization target, the train beat type running model is rebuilt; on the basis of defining a main path, a secondary path, a path interval, a diagraph node label collection and an initialization node label collection, the main path and the running interval with the minimum total costs from the beginning point to each node is searched through the constant generation of new labels and the update of the label values of the existing labels, until the check and the update of the node labels of the train end station are completed; finally the arrival and departure times and the running time intervals of each train station are determined according to the searched main path and the secondary path collection.

The invention discloses an article searching method and device based on hand drawing, and relates to the technical field of computers. A specific embodiment of the method comprises the steps of receiving a hand-drawn image, extracting a hand-drawn image in the hand-drawn image, and identifying feature information in the hand-drawn image; comparing the hand-drawn image with each article image in anarticle image library to extract article images of which the similarity exceeds a preset similarity threshold, obtaining article information corresponding to each extracted article image, and arranging the article information to generate a first article list; converting the feature information into a feature text label, performing article search based on the feature text label, and combining thesearched article information to obtain a second article list; and combining the article information in the first article list and the second article list to obtain a third article list, and displayingthe third article list. According to the embodiment, when the user cannot provide accurate keywords and cannot obtain corresponding article pictures, a more flexible search mode can be provided for the user, and the search experience of the user is improved.

A method for creating a custom work list includes executing a query based on search criteria. Results of the query comprising at least one of a business object and a task conforming to the search criteria. The search criteria and the returned results are combined to create said custom work list.

A data structure is described that comprises a balanced binary tree and a binary heap, which may be utilized for combinatorial searching algorithms. For instance, solutions for performing a task, such as a print job or the like, are associated with nodes that are utilized to generate the data structure. Each node is associated with a quality indicator that describes a most optimal solution that may be reached through the node when traversing the binary tree. The binary heap is generated from a subset of the nodes in the tree, wherein each node in the subset has a quality indicator value that is within a predefined range of a best known solution quality. The binary heap is sorted according to a search effort indicator value for each node, where nodes that are more easily reached in the tree are placed higher in the heap to facilitate rapid identification.