CA2915760C - Methode et systeme de resolution d'un probleme impliquant la division hypergraphique - Google Patents

Methode et systeme de resolution d'un probleme impliquant la division hypergraphique Download PDF

Info

Publication number
CA2915760C
CA2915760C CA2915760A CA2915760A CA2915760C CA 2915760 C CA2915760 C CA 2915760C CA 2915760 A CA2915760 A CA 2915760A CA 2915760 A CA2915760 A CA 2915760A CA 2915760 C CA2915760 C CA 2915760C
Authority
CA
Canada
Prior art keywords
unconstrained binary
binary optimization
partitioning
hypergraph
quadratic unconstrained
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CA2915760A
Other languages
English (en)
Other versions
CA2915760A1 (fr
Inventor
Arman Zaribafiyan
Dominic Marchand
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
1QB Information Technologies Inc
Original Assignee
1QB Information Technologies Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 1QB Information Technologies Inc filed Critical 1QB Information Technologies Inc
Priority to CA2915760A priority Critical patent/CA2915760C/fr
Publication of CA2915760A1 publication Critical patent/CA2915760A1/fr
Application granted granted Critical
Publication of CA2915760C publication Critical patent/CA2915760C/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00Computing arrangements using knowledge-based models
    • G06N5/01Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00Quantum computing, i.e. information processing based on quantum-mechanical phenomena

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • Computing Systems (AREA)
  • Computational Linguistics (AREA)
  • Artificial Intelligence (AREA)
  • Algebra (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Une méthode pour résoudre un problème impliquant une division hypergraphique est décrite, la méthode comprenant la réception dune indication dun problème impliquant une division hypergraphique; lobtention dau moins une propriété associée à un solveur doptimisation binaire non contrainte quadratique couplé de manière fonctionnelle à lordinateur numérique; la formulation dun problème de division de lhypergraphe comme problème doptimisation binaire non contrainte; la réduction du problème doptimisation binaire non contrainte en un problème doptimisation binaire non contrainte; le mappage du problème doptimisation binaire non contrainte quadratique en le solveur doptimisation binaire non contrainte quadratique; lobtention, à partir du solveur doptimisation binaire non contrainte quadratique, dau moins une solution au problème doptimisation binaire non contrainte quadratique; lapplication dune procédure de raffinement et la translation de la au moins une solution raffinée pour offrir une indication de la division et fournir une solution au problème.
CA2915760A 2015-12-22 2015-12-22 Methode et systeme de resolution d'un probleme impliquant la division hypergraphique Active CA2915760C (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CA2915760A CA2915760C (fr) 2015-12-22 2015-12-22 Methode et systeme de resolution d'un probleme impliquant la division hypergraphique

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CA2915760A CA2915760C (fr) 2015-12-22 2015-12-22 Methode et systeme de resolution d'un probleme impliquant la division hypergraphique

Publications (2)

Publication Number Publication Date
CA2915760A1 CA2915760A1 (fr) 2017-06-22
CA2915760C true CA2915760C (fr) 2019-05-07

Family

ID=59078310

Family Applications (1)

Application Number Title Priority Date Filing Date
CA2915760A Active CA2915760C (fr) 2015-12-22 2015-12-22 Methode et systeme de resolution d'un probleme impliquant la division hypergraphique

Country Status (1)

Country Link
CA (1) CA2915760C (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10733877B2 (en) 2017-11-30 2020-08-04 Volkswagen Ag System and method for predicting and maximizing traffic flow
US10959101B2 (en) * 2019-05-01 2021-03-23 Accenture Global Solutions Limited Cell resource allocation

Also Published As

Publication number Publication date
CA2915760A1 (fr) 2017-06-22

Similar Documents

Publication Publication Date Title
US9916283B2 (en) Method and system for solving a problem involving a hypergraph partitioning
US11144828B2 (en) Training task optimization system, training task optimization method and non-transitory computer readable medium for operating the same
JP6983154B2 (ja) 計算グラフの処理
US10310908B2 (en) Dynamic usage balance of central processing units and accelerators
US9053067B2 (en) Distributed data scalable adaptive map-reduce framework
Jansson et al. CUBE: A scalable framework for large-scale industrial simulations
Roget et al. Robust and efficient overset grid assembly for partitioned unstructured meshes
US10235182B2 (en) System and method for hybrid task management across CPU and GPU for efficient data mining
Gómez-Romero et al. Visualizing large knowledge graphs: A performance analysis
Arfat et al. Parallel shortest path graph computations of united states road network data on apache spark
US20160147571A1 (en) Method for optimizing the parallel processing of data on a hardware platform
Gao et al. GASPRNG: GPU accelerated scalable parallel random number generator library
Neshatpour et al. Energy-efficient acceleration of MapReduce applications using FPGAs
Oleksiak et al. M2DC–Modular Microserver DataCentre with heterogeneous hardware
CA2915760C (fr) Methode et systeme de resolution d'un probleme impliquant la division hypergraphique
Shirahata et al. A scalable implementation of a mapreduce-based graph processing algorithm for large-scale heterogeneous supercomputers
Caíno-Lores et al. A cloudification methodology for multidimensional analysis: Implementation and application to a railway power simulator
Yokota et al. Comparing the treecode with FMM on GPUs for vortex particle simulations of a leapfrogging vortex ring
WO2022022571A1 (fr) Attribution de ressources pour régler des hyper-paramètres de charges de travail d'apprentissage profond à grande échelle
Falahati et al. ORIGAMI: A heterogeneous split architecture for in-memory acceleration of learning
Bani Asadi et al. Paralearn: a massively parallel, scalable system for learning interaction networks on fpgas
Kapusta et al. Acceleration of image reconstruction in 3D Electrical Capacitance Tomography in heterogeneous, multi-GPU system using sparse matrix computations and Finite Element Method
George et al. A Unified Programmable Edge Matrix Processor for Deep Neural Networks and Matrix Algebra
Teijeiro et al. Parallel Brownian dynamics simulations with the message-passing and PGAS programming models
Kotlar et al. Energy efficient implementation of tensor operations using dataflow paradigm for machine learning