algorithmic problem造句

例句与造句

1. She has also been a strong promoter of computational thinking, expressing the algorithmic problem-solving and abstraction techniques used by computer scientists and how they might be applied in other disciplines.
2. Several algorithmic problems on squaregraphs may be computed more efficiently than in more general planar or median graphs; for instance, and present linear time algorithms for computing the diameter of squaregraphs, and for finding a vertex minimizing the maximum distance to all other vertices.
3. I just found another article here from an independent source published by IEEE . Here is the quote from the abstract about this article . " The renovated course emphasizes development of algorithmic problem solving skills and familiarity with the C programming language, Excel, and Matlab.
4. Marc van Kreveld suggested the algorithmic problem of computing shortest paths between vertices in a line arrangement, where the paths are restricted to follow the edges of the arrangement, more quickly than the quadratic time that it would take to apply a shortest path algorithm to the whole arrangement graph.
5. If, for example, someone were to create a function that returns a value indicating how similar one image is to another, a natural algorithmic problem would be to take a dataset of images and find the ones that are similar according to the function to a given query image.
6. It's difficult to find algorithmic problem in a sentence. 用algorithmic problem造句挺难的
7. With his co-authors Fedor Fomin, Mohammad T . Hajiaghayi, and Dimitrios Thilikos, he won the 2015 Nerode Prize for his work on bidimensionality, a general technique for developing both fixed-parameter tractable exact algorithms and approximation algorithms for a wide class of algorithmic problems on graphs.
8. Graph coloring has been studied as an algorithmic problem since the early 1970s : the chromatic number problem is one of Karp s 21 NP-complete problems from 1972, and at approximately the same time various exponential-time algorithms were developed based on backtracking and on the deletion-contraction recurrence of.
9. The concept of bounded local treewidth forms the basis of the theory of bidimensionality, and allows for many algorithmic problems on apex-minor-free graphs to be solved exactly by a polynomial-time algorithm or a fixed-parameter tractable algorithm, or approximated using a polynomial-time approximation scheme.
10. The related but different "'uniform word problem "'for a class " K " of recursively presented groups is the algorithmic problem of deciding, given as input a presentation " P " for a group " G " in the class " K " and two words in the generators of " G ", whether the words represent the same element of " G ".
11. Balinski s Ph . D . thesis concerned the vertex enumeration problem, the algorithmic problem of listing all vertices of a convex polytope or finding all optimal solutions of a linear program, He also proved the Hirsch conjecture for several different classes of polytopes associated with the transportation problem, showed that the diameter of the skeleton of the assignment polytope viewed as a graph is 2, and found the polytope whose vertices are the stable matchings of the university admissions problem.
更多例句：  上一页