Search results
Jump to navigation
Jump to search
Page title matches
- .... The output is a partition of the items into ''m'' subsets, such that the number of items in each subset is at most ''k''. Subject to this, it is requi ...a|date=2011-06-28|title=Heuristic Algorithms for Balanced Multi-Way Number Partitioning|url=https://www.aaai.org/ocs/index.php/IJCAI/IJCAI11/paper/view/3251|journa ...22 KB (3,359 words) - 10:33, 29 November 2023
- ...25|year=2006|editor1=Allon Percus|chapter=The Easiest Hard Problem: Number Partitioning|chapter-url=https://books.google.com/books?id=4YD6AxV95zEC&pg=PA125|publish ...the smallest sum. This objective is common in papers about multiway number partitioning, as well as papers originating from physics applications.<ref name=":3" /> ...32 KB (5,098 words) - 01:54, 26 January 2024
- {{Short description|Class of greedy algorithms for multiway number partitioning}} ...e. Greedy algorithms process the numbers sequentially, and insert the next number into a bin in which the sum of numbers is currently smallest. ...5 KB (826 words) - 14:38, 14 September 2024
- In [[computer science]], '''pseudopolynomial time number partitioning''' is a [[Pseudo-polynomial time|pseudopolynomial time]] algorithm for solv This algorithm runs in time {{math|''O''(''K N'')}}, where {{mvar|N}} is the number of elements in the input set and {{mvar|K}} is the sum of elements in the i ...5 KB (838 words) - 17:23, 9 November 2024
Page text matches
- {{Short description|Class of greedy algorithms for multiway number partitioning}} ...e. Greedy algorithms process the numbers sequentially, and insert the next number into a bin in which the sum of numbers is currently smallest. ...5 KB (826 words) - 14:38, 14 September 2024
- In [[computer science]], '''pseudopolynomial time number partitioning''' is a [[Pseudo-polynomial time|pseudopolynomial time]] algorithm for solv This algorithm runs in time {{math|''O''(''K N'')}}, where {{mvar|N}} is the number of elements in the input set and {{mvar|K}} is the sum of elements in the i ...5 KB (838 words) - 17:23, 9 November 2024
- ...[[tree (graph theory)|forests]] needed to cover all of its edges. Matroid partitioning may be solved in [[polynomial time]], given an [[matroid oracle|independenc ...ntly (by adding overlapping edges to each forest as necessary) the minimum number of [[spanning tree|spanning forests]] whose union is the whole graph. A for ...13 KB (2,168 words) - 03:57, 9 November 2024
- ...endra Karmarkar]] and [[Richard M. Karp]], "The differencing method of set partitioning", Tech report UCB/CSD 82/113, Computer science division, [[University of Ca | title=The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp ...15 KB (2,208 words) - 23:55, 15 July 2024
- ...r]]s and [[digital signal processing]]. Even for designs containing a good number{{Clarify|reason=vague|date=June 2016}} of [[datapath]] elements, the [[Micr #State minimization: the number of states is reduced by recognizing the equivalent states that are present ...5 KB (849 words) - 03:48, 26 December 2024
- === Polynomial partitioning === ...fs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique|journal=[[Discrete & Computational Geometry]]|volume=48|issue=3|y ...9 KB (1,433 words) - 06:20, 22 January 2024
- {{about|the heuristic algorithm for the graph partitioning problem|the heuristic for the traveling salesperson problem|Lin–Kernighan h ...|B}}. If the graph is unweighted, then instead the goal is to minimize the number of crossing edges; this is equivalent to assigning weight one to each edge. ...4 KB (693 words) - 05:39, 29 December 2024
- .... The output is a partition of the items into ''m'' subsets, such that the number of items in each subset is at most ''k''. Subject to this, it is requi ...a|date=2011-06-28|title=Heuristic Algorithms for Balanced Multi-Way Number Partitioning|url=https://www.aaai.org/ocs/index.php/IJCAI/IJCAI11/paper/view/3251|journa ...22 KB (3,359 words) - 10:33, 29 November 2023
- {{Short description|Minimum number of votes that a distributed transaction has to obtain}} A '''quorum''' is the minimum number of votes that a distributed transaction has to obtain in order to be allowe ...5 KB (733 words) - 12:11, 7 April 2024
- where <math>N_f </math> is the fatigue life of the material, that is, the number of loading cycles until failure. The fatigue life for each failure mechanis ===Strain-rate partitioning=== ...9 KB (1,429 words) - 22:18, 8 September 2024
- ...on which is minimal in some sense, for example a partition with a smallest number of units or with units of smallest total side-length. Polygon partitioning is an important class of problems in [[computational geometry]]. There are ...20 KB (2,836 words) - 07:53, 22 July 2024
- {{Short description|Process of partitioning a rectilinear polygon}} '''Guillotine partition''' is the process of partitioning a [[rectilinear polygon]], possibly containing some holes, into rectangles, ...11 KB (1,459 words) - 09:34, 13 December 2024
- ...of tweets which are sorted up to the second, the radius is bounded by the number of tweets in a second. Given a positive number <math>k</math>, a sequence <math>[a_1,\dots, a_n]</math> is said to be '''< ...8 KB (1,417 words) - 19:34, 4 December 2023
- ...]], a '''cycle decomposition''' is a decomposition (a [[partition of a set|partitioning]] of a graph's edges) into [[Cycle (graph theory)|cycles]]. Every vertex in ...can be decomposed into cycles of length <math>m</math> if and only if the number of edges in <math>K_n</math> is a multiple of <math>m</math>. ...2 KB (332 words) - 18:57, 11 August 2023
- ...hus a generalization of [[generalized circle]]s and their analogues in any number of dimensions. This inclusion provides a more regular structure under [[co This definition has been generalized to [[affine space]]s over [[complex number]]s and [[quaternion]]s by replacing the quadratic form with a [[Hermitian f ...8 KB (1,251 words) - 03:07, 2 May 2024
- ...me idea can be extended to point sets in more than two dimensions, but the number of sectors required grows exponentially with the dimension. ...2 KB (344 words) - 19:27, 18 February 2019
- '''Event partitioning''' is an easy-to-apply [[systems analysis]] technique that helps the analys The event-partitioning approach is explained by Stephen M. McMenamin and John F. Palmer in ''[[Ess ...14 KB (2,075 words) - 03:51, 24 July 2024
- ...d]] between the centroid based and all point extremes. In CURE, a constant number c of well scattered points of a cluster are chosen and they are shrunk towa ...lusters before computing the representative points for the merged cluster. Partitioning the input reduces the execution times. ...6 KB (848 words) - 23:09, 29 April 2022
- ...ath>k</math> cars. It is then preferred that each car delivers to an equal number of locations. ...2 KB (351 words) - 16:21, 30 December 2024
- ...Therefore, identical machine scheduling is equivalent to [[multiway number partitioning]]. A special case of identical machine scheduling is [[single-machine sched ...from the [[knapsack problem]].<ref name=":0" /> It is NP-hard even if the number of machines is fixed and at least 2, by reduction from the [[partition prob ...11 KB (1,569 words) - 13:05, 16 December 2023