Synoniemen & Informatie over | Engels woord SUBPROBLEM

---

---

---

---

---

---

---

---

---

---

Voorbeelden van het gebruik van SUBPROBLEM in een zin

• The above algorithm divides the problem into a number of subproblems recursively, each subproblem being of size.
• By carefully choosing a sequence of colorings of subsets, and finding the bichromatic closest pair of each subproblem, the minimum spanning tree may be found in time proportional to the optimal time for finding bichromatic closest pairs for the same number of points, whatever that optimal time turns out to be.
• In his view, Arrow's impossibility theorem in voting theory, the failure of simple pricing mechanisms, and the failure of previous analysis to explain the speeds of galactic rotation stem from the same cause: a reductionist approach that divides a complex problem (a multi-candidate election, a market, or a rotating galaxy) into multiple simpler subproblems (two-candidate elections for the Condorcet criterion, two-commodity markets, or the interactions between individual stars and the aggregate mass of the rest of the galaxy) but, in the process, loses information about the initial problem making it impossible to combine the subproblem solutions into an accurate solution to the whole problem.
• Because of the way this algorithm uses optimal substructures (the maximum subarray ending at each position is calculated in a simple way from a related but smaller and overlapping subproblem: the maximum subarray ending at the previous position) this algorithm can be viewed as a simple/trivial example of dynamic programming.
• The solution of the subproblem is either the solution of the unconstrained problem or it is used to determine the half-plane where the unconstrained solution center is located.
• On how to specifically overcome the change resistance subproblem, Markvart examined two leading theories that seemed to offer insight into change resistance, Panarchy theory and New Institutionalism, and concluded that:.
• Grohe's algorithm performs these simplifications until the remaining graph has a small treewidth, and then applies Courcelle's theorem to solve the reduced subproblem.

Paginavoorbereiding duurde: 180,99 ms.