Výsledky vyhľadávania - "F.2.2 Nonnumerical algorithms and problems"
-
1
Autori: Forrest M. Anderson, Forrest
Predmety: • Category Theory • Spectral Geometry • Noncommutative Geometry • Quantum Field Theory (QFT) • General Relativity • Gravity Quantization • Spectral Triple • Fluctuated Dirac Operator • Spectral Action Principle • Algebraic Unification • Gauge-Gravity Duality • Fermionic Bilinear • Operator-Theoretic Physics • Geometric Quantization • Mathematical Physics • Finite Element Method (FEM) • Spectral Approximation • Numerical Convergence • Bilinear Projection • Mesh Refinement • Sobolev Spaces • Eigenvalue Stability • Trace-Class Operators • Discretized Manifolds • Symbolic-to-Numerical Translation • IEEE 754 Compliance • Canonical Encoding • Deterministic Replay • Merkle Manifest • Cryptographic Attestation • Inclusion Proofs • Validator-Grade Verification • Reproducible Computation • Scientific Integrity • Manifest-Based Replication • MSC 81Txx – Quantum Theory • MSC 53Cxx – Differential Geometry • MSC 58Jxx – Partial Differential Equations on Manifolds • MSC 65N30 – FEM, PDEs • MSC 68P25 – Data Encoding and Compression • MSC 68Q87 – Cryptographic Protocols • ACM G.1.8 – Partial Differential Equations • ACM F.2.2 – Nonnumerical Algorithms and Problems • ACM D.4.6 – Security and Protection • ACM I.1.1 – Symbolic and Algebraic Manipulation • Alain Connes • Matilde Marcolli • Ivo Babuška • Ralph Merkle • IEEE Standards Association • Dan Boneh • Victor Shoup • Victoria Stodden • Gavin Wood • Scientific Reproducibility • Validator Framework • Cryptographic Verification • Open Science • Zenodo • arXiv • CERN • Mathematical Institute • Department of Applied Mathematics • Institute for Advanced Study
Relation: https://zenodo.org/records/17262968; oai:zenodo.org:17262968; https://doi.org/10.5281/zenodo.17262968
-
2
Autori: a ďalší
Zdroj: J Autom Reason
Beyersdorff, O, Blinkhorn, J, Leroy Chew, Schmidt, R & Suda, M 2018, 'Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF', Journal of Automated Reasoning, vol. 63, no. 0, pp. 597–623. https://doi.org/10.1007/s10817-018-9482-4
Journal of Automated ReasoningPredmety: Dependency schemes, 0202 electrical engineering, electronic engineering, information engineering, DQBF, Quantified Boolean formulas, 0102 computer and information sciences, 02 engineering and technology, F.2.2 Nonnumerical algorithms and problems, 01 natural sciences, Article
Prístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10817-018-9482-4.pdf
https://pubmed.ncbi.nlm.nih.gov/31496547
https://www.research.manchester.ac.uk/portal/en/publications/reinterpreting-dependency-schemes-soundness-meets-incompleteness-in-dqbf(c21330aa-c463-4cf7-b62a-9963d26aaad7).html
https://link.springer.com/content/pdf/10.1007/s10817-018-9482-4.pdf
https://europepmc.org/article/PMC/PMC6710225
https://link.springer.com/article/10.1007/s10817-018-9482-4
https://dblp.uni-trier.de/db/journals/jar/jar63.html#BeyersdorffBCSS19
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6710225 -
3
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 25th Annual European Symposium on Algorithms (ESA 2017) ; https://hal.science/hal-01740357 ; 25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩
Predmety: Combinatorial Optimization, Expansion, Hall's Theorem, Local Search, Planar Graphs, ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, [SCCO.COMP]Cognitive science/Computer science
-
4
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: 27th Annual Symposium on Combinatorial Pattern Matching CPM 2016
https://hal.science/hal-03942914
27th Annual Symposium on Combinatorial Pattern Matching CPM 2016, 2016, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2016.21⟩Predmety: 1998 ACM Subject Classification F.2.2. Nonnumerical Algorithms and Problems phrases Randomised algorithms string similarity measures longest common substring sketching locality-sensitive hashing, string similarity measures, longest common substring, sketching, locality-sensitive hashing, [INFO]Computer Science [cs]
Relation: hal-03942914; https://hal.science/hal-03942914; https://hal.science/hal-03942914/document; https://hal.science/hal-03942914/file/LIPIcs-CPM-2016-21.pdf
-
5
Autori:
Zdroj: ACM transactions on the web 3 (2009). doi:10.1145/1513876.1513879
info:cnr-pdr/source/autori:Dourisboure Y.; Geraci F.; Pellegrini M./titolo:Extraction and classification of dense implicit communities in the Web Graph/doi:10.1145%2F1513876.1513879/rivista:ACM transactions on the web/anno:2009/pagina_da:/pagina_a:/intervallo_pagine:/volume:3Predmety: communities, H.2.8 Database applications. Clustering, web graph, detection of dense subgraph, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, F.2.2 Nonnumerical Algorithms and Problems. Computations on discrete structures
Prístupová URL adresa: http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://dl.acm.org/doi/10.1145/1513876.1513879
https://dblp.uni-trier.de/db/journals/tweb/tweb3.html#DourisboureGP09
https://doi.org/10.1145/1513876.1513879
http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://hdl.handle.net/20.500.14243/46197
https://doi.org/10.1145/1513876.1513879 -
6
Autori:
Prispievatelia:
Zdroj: IEEE Transactions on Mobile Computing. 3:246-257
Predmety: G.3 Probability and statistics, FOS: Computer and information sciences, Sensor networks, topology control, Discrete Mathematics (cs.DM), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], coverage, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], energy consumption, minimum/maximum degrees, Computer Science - Data Structures and Algorithms, transmitting/sensing ranges, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), F.2.2 Nonnumerical algorithms and problems, [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM classification: C.2.1 Network architecture and design, Parallel, analytical methods, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], and Cluster Computing [cs.DC], hop-diameter, Computer Science - Distributed, Parallel, and Cluster Computing, connectivity, ad hoc networks, Distributed, Parallel, and Cluster Computing (cs.DC), Computer Science - Discrete Mathematics
Popis súboru: application/pdf
Prístupová URL adresa: http://arxiv.org/pdf/cs/0411027
http://arxiv.org/abs/cs/0411027
https://dl.acm.org/doi/10.5555/2212317.2212332
http://ieeexplore.ieee.org/document/1318594/
http://ui.adsabs.harvard.edu/abs/2004cs.......11027R/abstract
https://www.computer.org/csdl/trans/tm/2004/03/h0246.html
https://dblp.uni-trier.de/db/journals/tmc/tmc3.html#Ravelomanana04
http://ieeexplore.ieee.org/iel5/7755/29217/01318594.pdf
https://doi.org/10.1109/TMC.2004.23
https://hal.science/hal-00003248v1
https://hal.science/hal-00003248v1/document -
7
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2013)
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS)
https://hal.science/hal-00843628
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), Sep 2013, Sophia Antipolis, France. 12 p, ⟨10.4230/OASIcs.ATMOS.2013.150⟩Predmety: Dynamic Carpooling, Shortest Path Problem, Synchronized Paths,
"G.2.1 Combinatorics", "G.2.2 Graph Theory", "F.2.2 Nonnumerical Algorithms and Problems", [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] Geografické téma: Sophia Antipolis, France
-
8
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)
https://hal.science/hal-00587955
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 4 pPredmety: small worlds, social networks, peer-to-peer networks, decentralized search, optimal paths, \category{F.2.2}{Nonnumerical Algorithms and Problems}{Routing and layout} \category{E.1}{Data Structures}{Graphs and networks} \category{G.2.2}{Graph Theory}{Graph algorithms, Network problems} \category{C.2.2}{Network Protocols}{Routing protocols}, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [SHS.SOCIO]Humanities and Social Sciences/Sociology
Geografické téma: Cap Estérel, France
-
9
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Proceedings of the 2008 ACM symposium on Applied computing ; Symposium on Applied Computing ; https://hal.science/hal-00421496 ; Symposium on Applied Computing, 2008, Brazil. p. 1843-1844, ⟨10.1145/1363686.1364130⟩
Predmety: geometric constraints, preferences, decomposition, ACM F.2.2 Nonnumerical Algorithms and Problems, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
-
10
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 0304-3975.
Predmety: Complexity, Enumeration, Expected complexity, Lambda calculus complexity enumeration expected complexity, F.3.2 Semantics of Programming Languages F.2.2 Nonnumerical Algorithms and Problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
-
11
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Geometrical problems and computations, H.2.8 [Database Management, Database Applications—Data Mining, Image Databases, Spatial Databases and GIS General Terms, Performance, Algorithms Keywords, Terrain modeling, GIS, visibility, navigation
Popis súboru: application/pdf
-
12
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems] General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Pricing, Algorithmic Game theory, Social Networks
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.340; http://www.tau.ac.il/~nogaa/PDFS/localprice3.pdf
-
13
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors F.2.2 [Nonnumerical Algorithms and Problems, Geometrical problems and computations General Terms Algorithms, Theory Keywords Hegselmann-Krause system, opinion dynamics, convergence
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.717; http://www.cs.princeton.edu/~hlnguyen/papers/opinions.pdf
-
14
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Sequencing and scheduling, C.1.4 [Parallel Architectures, Distributed architectures General Terms, Algorithms, Performance, Theory Additional Key Words and Phrases, workflow programming, filter-stream programming, scheduling, pipeline, throughput, latency, models, distributed systems, parallel systems
Popis súboru: application/pdf
-
15
Autori:
Prispievatelia:
Predmety: putation, F.2.2 [Nonnumerical Algorithms and Problems, Computations on discrete structures, F.3.1 [Specifying and Verifying and Reasoning about Programs, Mechanical verification, F.4.1 [Mathematical Logic, Logic and constraint programming. Keywords and phrases automata theory, pushdown systems, sets with atoms, saturation tech- nique. Digital Object Identifier 10.4230/LIPIcs.xxx.yyy.p
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.7211; http://www.mimuw.edu.pl/%7Esl/PAPERS/csl15.pdf
-
16
Autori:
Prispievatelia:
Predmety: Categories and Subject Descriptors H.3.1 [Content Analysis and Indexing, Abstracting methods, F.2.2 [Nonnumerical Algorithms and Problems, Computations on
Popis súboru: application/pdf
-
17
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Engineering, F.2.2 [Nonnumerical Algorithms and Problems, Geometrical problems and computations, H.2.8 [Database Management, Database Applications—Data Mining, Image Databases, Spatial Databases and GIS General Terms, Performance, Algorithms Keywords, LIDAR, Massive data, GIS, Natural Neighbor Interpolation
Popis súboru: application/pdf
-
18
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors F.2.2 [Nonnumerical Algorithms and Problems, General—Sequencing and scheduling General Terms Algorithms Keywords Direction Election, Flocking, Swarms
Popis súboru: application/pdf
-
19
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, D.2 [Software, Software Engineering, F.2.2 [Nonnumerical Algorithms and Problems, Geometrical problems and computations, H.2.8 [Database Management, Database Applications—Data Mining, Image Databases, Spatial Databases and GIS General Terms, Performance, Algorithms Keywords, LIDAR, Massive data, GIS
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.7693; http://www.cs.duke.edu/~pankaj/publications/papers/comgeo.pdf
-
20
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors F.2.2 [Nonnumerical Algorithms and Problems, Computations on discrete structures General Terms Algorithms, Theory Keywords matroid, matching, local search
Popis súboru: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder