• PSATO

  • Referenced in 42 articles [sw02635]
  • method is that the current processes explore disjoint portions of the search space. In this...
  • AVATAR

  • Referenced in 19 articles [sw28636]
  • that can be split into components with disjoint sets of variables. Such clauses are common...
  • Polygraph

  • Referenced in 17 articles [sw23932]
  • Polygraph generates signatures that consist of multiple disjoint content substrings. In doing so, Polygraph leverages...
  • EXTRACOL

  • Referenced in 10 articles [sw06552]
  • tabu search algorithm, a number of pairwise disjoint independent sets of a given size...
  • ICF3D

  • Referenced in 9 articles [sw03509]
  • parallelizes by decomposing physical space into disjoint subdomains, and relies on message passing libraries such...
  • L2WPMA

  • Referenced in 9 articles [sw04326]
  • divides the data into at most k disjoint sets of adjacent data and solves...
  • TDDS

  • Referenced in 7 articles [sw31513]
  • distinctive property of a Thomas decomposition is disjointness of the solution sets of the output...
  • HiRise

  • Referenced in 7 articles [sw36184]
  • adopting techniques that utilize the sparsity and disjointness of constraint systems. Based on this algorithm...
  • EdgeRewire

  • Referenced in 7 articles [sw40656]
  • captures the “partitionability” of a graph into disjoint components. In this work we address...
  • PlaNet

  • Referenced in 4 articles [sw00711]
  • focus so far has been on disjoint path problems. However, the package is intended ... develop new variations of well-known disjoint path algorithms, which heuristically optimize additional 𝒩𝒫-hard ... prove that the problem of finding edge-disjoint paths of minimum total length...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • Minimum cost disjoint paths under arc dependences. Algorithms for practice. In this thesis, we develop ... unified algorithmic framework for Minimum Cost Disjoint Paths Problems. These problems arise in a variety ... project with Containerterminal Altenwerder at Hamburg harbour. Disjoint Paths Problems are posed in the form ... programming model flexible enough to accommodate several disjointness modes, yet practical enough to allow...
  • RCWA

  • Referenced in 6 articles [sw00786]
  • group which is generated by involutions interchanging disjoint residue classes of Z and which...
  • GTSP-LIB

  • Referenced in 6 articles [sw25565]
  • with a partition of the vertices into disjoint sets. The objective is to find...
  • Hereditarily Finite Sets

  • Referenced in 6 articles [sw29249]
  • possible in ZF set theory (Cartesian products, disjoint sums, natural numbers, functions) without using infinite...
  • MapSets

  • Referenced in 4 articles [sw13776]
  • overlaps even if the input clusters are disjoint. par Both fragmented regions and unnecessary overlaps ... sound geometric algorithm which guarantees contiguity and disjointness of the regions, and also optimizes...
  • AS 308

  • Referenced in 5 articles [sw14161]
  • interval or a set of disjoint intervals. This algorithm has been successfully used in several...
  • RingSTM

  • Referenced in 5 articles [sw25976]
  • same time permitting parallel writeback by concurrent disjoint transactions.We evaluate three variants of the RingSTM...
  • PowerForms

  • Referenced in 4 articles [sw01540]
  • definitions of PowerForms formats are syntactically disjoint from the form itself, which allows a modular...
  • MICC

  • Referenced in 4 articles [sw16450]
  • 𝒞 1 (S g ), if there are disjoint representatives in S g . A metric...
  • sns

  • Referenced in 4 articles [sw17406]
  • strategy, in which SNS is applied to disjoint subsets of state space, wrapped...