• Suche: "Nonnumerical algorithms"

Treffer 1 - 20 von 4.040

1

Proof-theoretic aspects of the logic of scope
Moot, Richard ; Exploration et exploitation de données textuelles (LIRMM | TEXTE) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Journal of Logic. 34:463-514

Parsing as deduction Proof nets Proof theory Type-logical grammars ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Zeitschrift
Zu den Favoriten
2

On the QUBO formulation of Hamiltonian Cycle Problem
Durbec, Amelia ; El Yaagoubi, Amina ; Deleplanque, Samuel ; et al.
Philosophical Transactions of the Royal Society A: Mathematical. 383(2310):1-19

Combinatorial optimizati... QUBO ISING embedding quantum computing hamiltonian cycle proble... …
Zeitschrift
Zu den Favoriten
3

On the twin-width of smooth manifolds
Bonnet, Édouard ; Huszár, Kristóf ; Modèles de calcul, Complexité, Combinatoire (MC2) ; et al.
41st International Symposium on Computational Geometry (SoCG 2025). :23-23

Kanazawa, Japan computational topology structural graph paramet... Whitney embedding theore... twin-width triangulations …
Konferenz
Zu den Favoriten
4

Enumerating Minimal Connected Dominating Sets: Enumerating minimal connected dominating sets
Faisal Abu-Khzam ; Henning Fernau ; Benjamin Gras ; et al.
SIAM Journal on Discrete Mathematics. 39:946-972

connected domination Connectivity Vertex subsets with spec... enumeration problems degenerate graphs Graph algorithms (graph-... …
Fachzeitschrift
Zu den Favoriten
5

When alpha-complexes collapse onto codimension-1 submanifolds
Attali, Dominique ; Clémot, Mattéo ; Dornelas, Bianca, B. ; et al.

Submanifold reconstructi... triangulation abstract simplicial comp... collapses convexity 65D18, 57Q05 …
E-Ressource
Zu den Favoriten
6

The aperiodic Domino problem in higher dimension
Le problème du Domino apériodique en dimension supérieure
de Menibus, Benjamin Hellouin ; Callard, Antonin ; Graphes, Algorithmes et Combinatoire - LISN (GALaC) ; et al.
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). :1-15

Marseille, France subshift periodicity aperiodicity domino problem subshift of finite type …
Konferenz
Zu den Favoriten
7

On the twin-width of smooth manifolds
Bonnet, Édouard ; Huszár, Kristóf ; Modèles de calcul, Complexité, Combinatoire (MC2) ; et al.

triangulations twin-width Whitney embedding theore... structural graph paramet... computational topology MSC: 57Q15 (Primary) 57R... …
E-Ressource
Zu den Favoriten
8

A Framework for Fixed Priority Periodic Scheduling Synthesis from Synchronous Data-flow Graphs
Tran, Hai, Nam ; Honorat, Alexandre ; Bhattacharyya, Shuvra, S ; et al.
SAMOS XXI 2021 - 21st International Conference on embedded computer Systems: Architectures. :1-12

Virtual, France Antiviral action Dengue Flavonoid Hepatitis C virus Influenza …
Konferenz
Zu den Favoriten
9

Fast and accurate genome-scale identification of DNA-binding sites
Martin, David ; Maillol, Vincent ; Rivals, Eric ; et al.
BIBM 2018 - 12th IEEE International Conference on Bioinformatics and Biomedicine. :201-205

Madrid, Spain Web Bioinformatics Pattern matching Stringology Search …
Konferenz
Zu den Favoriten
10

Nonnumerical Algorithms and Problems — Sequencing and schedulingMergeable Schedules for Lazy Matching
Leslie De Koninck ; The Pennsylvania State University CiteSeerX Archives
http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf.

Schedules lazy pattern matching rule based languages. CR... E.1 [Data Structures F.2.2 [Analysis of Algor... F.2.2 [Analysis of Algor...
Fachzeitschrift
Zu den Favoriten
11

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm
Balabonski, Thibaut ; Delga, Amélie ; Rieg, Lionel ; et al.
Theory of Computing Systems. 63(2):200-218

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.4: Distributed Syste... C.2.4.1: Distributed app... ACM: D.: Software D.4: OPERATING SYSTEMS …
Zeitschrift
Zu den Favoriten
12

On the width of complicated JSJ decompositions
Sur la largeur des décompositions JSJ compliquées
Huszár, Kristóf ; Spreer, Jonathan ; Laboratoire de l'Informatique du Parallélisme (LIP) ; et al.
39th International Symposium on Computational Geometry (SoCG 2023). :42-42

Dallas, United States generalized Heegaard spl... fixed-parameter tractabi... computational 3-manifold... triangulations treewidth …
Konferenz
Zu den Favoriten
13

A Sequent Calculus for a Modal Logic on Finite Data Trees
Baelde, David ; Lunel, Simon ; Schmitz, Sylvain ; et al.
CSL 2016. :1-16

Marseille, France XPath proof systems modal logic complexity ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
14

The Complexity of Coverability in ν-Petri Nets
Lazić, Ranko ; Schmitz, Sylvain ; Centre for Discrete Mathematics and its Applications [Warwick] (DIMAP) ; et al.
LICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science. :467-476

New York, United States Well-structured transiti... Formal verification Well-quasi-order Order ideal Fast-growing complexity …
Konferenz
Zu den Favoriten
15

Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes
Meyer, Antoine ; Modeste, Simon ; Laboratoire d'Informatique Gaspard-Monge (LIGM) ; et al.

Lille, France complexité algorithme problème didactique ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
16

Validator-Grade Resolution of Quantum Field Theory and Gravity via Spectral Geometry, Numerical Realization, and Cryptographic Attestation
Forrest M. Anderson, Forrest

• Category Theory • Spec... PDEs • MSC 68P25 – Data...
Fachzeitschrift
Zu den Favoriten
17

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams: Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
Arijit Bishnu ; Arijit Ghosh ; Sudeshna Kolay ; et al.
Theory of Computing Systems. 67:1241-1267

streaming algorithms Analysis of algorithms a... FPT Combinatorial Optimizati... Constraint Satisfaction... 0102 computer and inform... …
Fachzeitschrift
Zu den Favoriten
18

The Ideal View on Rackoff's Coverability Technique
Lazić, Ranko ; Schmitz, Sylvain ; University of Warwick [Coventry] ; et al.
RP 2015 - 9th International Workshop on Reachability Problems. :1-13

Warsaw, Poland complexity ideal well-quasi-order vector addition system ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
19

A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
Algorithms - ESA 2015. :595-606

Patras, Greece Lovász local lemma simplex quality distance and incircle pr... relaxed Delaunay complex witness complex …
Konferenz
Zu den Favoriten
20

Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets
Bannwarth, Ivan ; Safey El Din, Mohab ; Polynomial Systems (PolSys) ; et al.
ISSAC'15 - 40th International Symposium on Symbolic and Algebraic Computation. :37-44

Bath, United Kingdom Real solutions Polynomial systems Real Geometry General Te... Theory Real dimension …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter