Patents
Literature
10 results about "Search problem" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In computational complexity theory and computability theory, a search problem is a type of computational problem represented by a binary relation. If R is a binary relation such that field(R) ⊆ Γ⁺ and T is a Turing machine, then T calculates R if: If x is such that there is some y such that R(x, y) then T accepts x with output z such that R(x, z) (there may be multiple y, and T need only find one of them) If x is such that there is no y such that R(x, y) then T rejects x Intuitively, the problem consists in finding structure "y" in object "x".
Interactive command line tool-oriented intelligent task planning and execution method and system
The invention provides an interactive command line tool-oriented intelligent task planning and execution method and system, and the method comprises the steps: S1, generating a corresponding command sequence template for each operation of a target tool through a first large language model, and constructing an executable knowledge base; s2, calculating the semantic similarity between the task description and each command sequence template to obtain a candidate set, and selecting the most relevant template as a retrieval context by using a second large language model; s3, modeling a task execution process as a state diagram search problem, selecting candidate nodes from reachable nodes of a current node based on an algorithm, and selecting an optimal node according to a current state and a retrieval context by utilizing a second large language model; s4, executing an execution action corresponding to the optimal node, and analyzing tool output by using a second large language model to adjust a heuristic value of the corresponding node and execute a corresponding rollback strategy; and S5, repeating the steps S3 to S4 until the reasoning result shows that the task reaches the target node or the number of attempts exceeds a preset threshold.
Owner:FUJIAN NORMAL UNIV
Extensible deep neural network channel pruning method and system
The invention relates to the technical field of artificial intelligence, in particular to an extensible deep neural network channel pruning method and system. According to the method, a channel pruning problem is converted into a structure search problem, and an artificial bee colony algorithm is provided to find an optimal pruning structure. A coupled model structure is mapped into a non-coupled search structure through structure mapping, and an optimal pruning structure is searched and fine-tuned based on an artificial bee colony algorithm, so that the search space of the deep neural network is reduced, and the pruning problem of the coupled structure is solved.
Owner:NORTHWEST A & F UNIV
Intelligent task planning and execution method and system for interactive command line tools
The application provides an intelligent task planning and execution method and system for an interactive command line tool, comprising the following steps: S1, using a first large language model to generate a corresponding command sequence template for each operation of the target tool, and constructing an executable knowledge base; S2, calculating the semantic similarity between the task description and each command sequence template to obtain a candidate set, and using a second large language model to select the most relevant template as a retrieval context; S3, modeling the task execution process as a state graph search problem, selecting a candidate node from the reachable nodes of the current node based on an algorithm, and using the second large language model to select the optimal node according to the current state and the retrieval context; S4, executing the execution action corresponding to the optimal node, using the second large language model to parse the tool output, adjusting the heuristic value of the corresponding node and executing the corresponding rollback strategy; and S5, repeating steps S3 to S4 until the reasoning result shows that the task reaches the target node or the number of attempts exceeds the preset threshold.
Owner:FUJIAN NORMAL UNIV
A control law automatic design method based on long short-term memory network
ActiveCN117826591BAchieve integrated optimizationreduce dependenceAdaptive controlSearch problemNetwork architecture
The application discloses a control law automatic design method based on a long short-term memory network. The method draws on the experience of network architecture search method in deep learning, utilizes the advantage of a recurrent neural network in time sequence correlation exploration, converts a control law structure design problem into a directed acyclic graph topological relation automatic search problem, realizes automatic generation of a flight control law control structure, and realizes automatic setting of parameters under a given control law structure based on a genetic algorithm. The method aims at overcoming the limitation that current control law automatic optimization can only utilize a heuristic algorithm to automatically set controller parameters for a known controller structure, reducing the artificial design workload, and improving the control effect under complex design input conditions.
Owner:BEIJING AEROSPACE AUTOMATIC CONTROL RES INST
Question and answer search method and device, equipment and storage medium
PendingCN121255965ASpecial data processing applicationsText database clustering/classificationUser needsSearch problem
Owner:BEIJING QIHOOD TECHNOLOGY CO LTD
Neural network channel number search method and apparatus
A neural network channel number searching method and device can realize a differentiable search technology to search network channel numbers, reduce the calculation complexity of the network while ensuring the network performance. The method comprises the following steps: determining the output channel number N of a convolutional layer, wherein N is a positive integer (S301); dividing the feature tensor output by the convolutional layer into n sub-feature tensors, wherein the channel number of each sub-feature tensor is N / n, n is an integer that can be divided by N, and n is greater than or equal to 2 (S302); determining n sets of weighting coefficients, wherein each set of weighting coefficients comprises a plurality of weighting coefficients, and the plurality of weighting coefficients correspond to a plurality of sub-feature tensors in the n sub-feature tensors one by one (S303); determining the sub-feature tensor corresponding to the maximum value in each set of weighting coefficients (S304) to obtain the sub-feature tensors corresponding to the n maximum values; and re-determining the output channel number of the convolutional layer according to the sub-feature tensors corresponding to the n maximum values (S305).
Owner:HUAWEI TECH CO LTD
High-dimensional information enhanced perception method based on chain decomposition
The invention provides a high-dimensional information enhancement perception method based on chain decomposition, relates to the technical field of information enhancement, considers a single-station radar system working under a millimeter wave frequency, comprises an MIMO antenna array of a uniform rectangular array at a transmitting end and a receiving end, and comprises the following steps: establishing global correlation among different dimensions of a high-order signal; establishing a conversion relation between chain decomposition and CP decomposition, and introducing a minimum description length criterion to determine a chain decomposition rank number; correcting the ray tracking simulator based on the corner reflector; expanding a simulation scene, and generating a sensing environment and a sensing echo under a calibration physical condition; constructing a Riemannian manifold structure, and optimizing statistical distribution in combination with multiple geometric metrics; a retrieval problem is converted into a geometric mean value optimization problem, and the difference between a target and interference is maximized. According to the method, the perception echo performance is enhanced from the distance-speed-angle dimensions of the target object, so that the target object is clearer, and target object detection and parameter estimation are facilitated.
Owner:DALIAN MARITIME UNIVERSITY
Intelligent music creation auxiliary method based on music theory
The invention discloses an intelligent music creation auxiliary method based on a music theory, and belongs to the technical field of music creation. According to the method, intelligent assistance of a music creation process is realized by fusing multi-modal intention input and a structured music theory rule base, a pre-constructed structured music theory rule base is utilized to dynamically map a user intention into a computable constraint parameter, and on the basis, a problem modeling technology is satisfied through constraint, so that the problem modeling efficiency is improved. A music creation problem is converted into a feasible solution space search problem in mathematics, a music fragment conforming to the intention of a user is efficiently searched in a solution space by means of a constraint propagation and backtracking algorithm, a result is output in a multi-mode form, and meanwhile interpretable feedback of the creation process is provided. By means of the method, music theoretical knowledge and user personalized requirements can be effectively integrated, the accuracy and usability of the generated result are improved, meanwhile, dependence on professional literacy of the user is reduced, and efficient and intelligent music creation assistance is achieved.
Owner:ANYANG NORMAL UNIV
Discrete event simulation-oriented hexagonal lattice way-finding method
The invention discloses a hexagonal lattice path finding method for discrete event simulation. On the basis of a traditional A star algorithm, firstly, the operation of judging and cutting (namely pruning processing) is put forward when six nodes adjacent to a current node are cyclically traversed, and then the slope value between a reserved node and a target node is calculated; and finally, selecting the node of which the slope value is closest to the slope value between the starting node and the target node to enter the next round of path finding process. According to the method, the problem that many useless nodes are searched when a traditional heuristic A star search algorithm faces obstacles is solved, the calculation time and the storage space used for searching are reduced in the aspect of space calculation such as way finding in the field of discrete event simulation based on aviation, navigation, ground and the like, and the calculation efficiency of the A star algorithm is greatly improved; the problem of low calculation efficiency of way-finding calculation and the like in the simulation deduction process in the discrete event simulation field based on aviation, navigation, ground and the like is solved.
Owner:INST OF SOFTWARE - CHINESE ACAD OF SCI
Password cracking method, quantum mixing system, storage medium and electronic equipment
The invention provides a password cracking method, a quantum mixing system, a storage medium and electronic equipment, and the method comprises the steps: generating target data corresponding to a key value based on the key value of a key bit of a preset key; obtaining intermediate value data generated by key encryption; performing distributed splitting on the intermediate value data serving as a search problem to obtain a plurality of sub-problems, splitting the target data based on each sub-problem to obtain a first quantum state, and performing quantum coding on each sub-problem to obtain a second quantum state and coding information; based on whether the second quantum state corresponding to each sub-problem is matched with the first quantum state, obtaining a search result of each sub-problem; the global search result is obtained based on the coding information and the search result of each sub-problem, and the key value of the key bit is obtained according to the global search result, the probability of error results is reduced through the search results of the sub-problems and the global search result, the private key corresponding to the key is obtained, and quantum hardware resource consumption of a quantum search algorithm is reduced.
Owner:YANGTZE DELTA IND INNOVATION CENT OF QUANTUM SCI & TECH