Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Anders, Markus"'
Symmetry breaking is a widely popular approach to enhance solvers in constraint programming, such as those for SAT or MIP. Symmetry breaking predicates (SBPs) typically impose an order on variables and single out the lexicographic leader (lex-leader)
Externí odkaz:
http://arxiv.org/abs/2407.04419
Symmetry reduction is crucial for solving many interesting SAT instances in practice. Numerous approaches have been proposed, which try to strike a balance between symmetry reduction and computational overhead. Arguably the most readily applicable me
Externí odkaz:
http://arxiv.org/abs/2406.13557
Comparative analysis of scalar fields in scientific visualization often involves distance functions on topological abstractions. This paper focuses on the merge tree abstraction (representing the nesting of sub- or superlevel sets) and proposes the a
Externí odkaz:
http://arxiv.org/abs/2308.08484
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symmetries usually takes a black box approach. Typically, off-the-shelf ext
Externí odkaz:
http://arxiv.org/abs/2306.00613
State-of-the-art solvers for symmetry detection in combinatorial objects are becoming increasingly sophisticated software libraries. Most of the solvers were initially designed with inputs from combinatorics in mind (nauty, bliss, Traces, dejavu). Th
Externí odkaz:
http://arxiv.org/abs/2302.06351
Autor:
Anders, Markus
Exploitation of symmetries is an indispensable approach to solve certain classes of difficult SAT instances. Numerous techniques for the use of symmetry in SAT have evolved over the past few decades. But no matter how symmetries are used precisely, t
Externí odkaz:
http://arxiv.org/abs/2205.12799
Random data augmentations (RDAs) are state of the art regarding practical graph neural networks that are provably universal. There is great diversity regarding terminology, methodology, benchmarks, and evaluation metrics used among existing RDAs. Not
Externí odkaz:
http://arxiv.org/abs/2112.04314
Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in general. Through backtracking, on each graph an IR-algorithm implicitly cre
Externí odkaz:
http://arxiv.org/abs/2109.07302
Autor:
Anders, Markus, Schweitzer, Pascal
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the automorphis
Externí odkaz:
http://arxiv.org/abs/2108.04590
Color refinement is a crucial subroutine in symmetry detection in theory as well as practice. It has further applications in machine learning and in computational problems from linear algebra. While tight lower bounds for the worst case complexity ar
Externí odkaz:
http://arxiv.org/abs/2103.10244