Výsledky vyhľadávania - algorithms: Subject classification: programming

Differences in Students' Computational Thinking Activities When Designing an Algorithm for Drawing Plane Figures

Autori: Carina Büscher (ORCID 0000-0003-4258-8992)

Zdroj: International Journal of Science and Mathematics Education. 2025 23(2):365-386.

Peer Reviewed: Y

Počet strán: 22

Descriptors: Mathematics Instruction, Thinking Skills, Teaching Methods, Computer Science Education, Programming, Grade 6, Geometric Concepts, Freehand Drawing, Learning Activities, Classification, Algorithms

Core-Guided Linear Programming-Based Maximum Satisfiability

Autori: Katsirelos, George George Katsirelos Jeremias Berg a ďalší

Prispievatelia: Katsirelos, George George Katsirelos Jeremias Berg a ďalší

Predmety: 2012 ACM Subject Classification Theory of computation → Discrete optimization, maximum satisfiability, Mathematics of computing → Solvers phrases maximum satisfiability, Theory of computation → Discrete optimization, Mathematics of computing → Combinatorial optimization, linear programming, Mathematics of computing → Solvers, 2012 ACM Subject Classification Theory of computation → Discrete optimization Mathematics of computing → Combinatorial optimization Theory of computation → Logic Mathematics of computing → Solvers phrases maximum satisfiability, [INFO] Computer Science [cs], ddc:004, Theory of computation → Logic, core-guided solvers

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.17
https://hal.inrae.fr/hal-05222608v1/document
https://doi.org/10.4230/lipics.sat.2025.17
https://hal.inrae.fr/hal-05222608v1

On solving difference of convex functions programs with linear complementarity constraints

Autori: Le Thi, Hoai An Nguyen, Thi Minh Tam Dinh, Tao Pham a ďalší

Prispievatelia: Le Thi, Hoai An Nguyen, Thi Minh Tam Dinh, Tao Pham a ďalší

Zdroj: Computational Optimization and Applications. 86:163-197

Predmety: Difference of convex functions constraints, Difference of convex functions algorithm, 90C30, [INFO]Computer Science [cs], Difference of convex functions programming, Mathematical program with linear complementarity constraints, [MATH] Mathematics [math], 90C33, [MATH]Mathematics [math], [INFO] Computer Science [cs], Penalty function, 90C90 (Mathematics Subject Classification), 90C26

Prístupová URL adresa: https://hal.univ-lorraine.fr/hal-04151433v1
https://doi.org/10.1007/s10589-023-00487-y

An Algorithmic Framework for Locally Constrained Homomorphisms

Autori: Bulteau, Laurent Dabrowski, Konrad Köhler, Noleen a ďalší

Prispievatelia: Bulteau, Laurent Dabrowski, Konrad Köhler, Noleen a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783031159138
Bekos, M.A. & Kaufmann, M. (Eds.). Graph-Theoretic Concepts in Computer Science. WG 2022. : Springer, pp. 114-128, Lecture Notes in Computer Science, Vol.13453

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), fracture number, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, (locally constrained) graph homomorphism parameterized complexity fracture number, integer linear programming, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), parameterized complexity, role assignment, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism, deletion set/modulator to small components, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism parameterized complexity deletion set/modulator to small components role assignment integer linear programming, Computer Science - Computational Complexity, Combinatorics (math.CO), Recherche opérationnelle, (locally constrained) graph homomorphism, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2201.11731
https://hal.science/hal-04495171v1
https://doi.org/10.1007/978-3-031-15914-5_9
https://hal.science/hal-04495171v1/document
http://dro.dur.ac.uk/37188/
http://dro.dur.ac.uk/37188/1/37188.pdf
https://doi.org/10.1007/978-3-031-15914-5_9

Integrating elements of data science into high-school teaching: Naïve Bayes-classification algorithm and programming in Python

Autori: Ödön Vancsó Péter Princz

Zdroj: Teaching Mathematics and Computer Science. 18:307-316

Predmety: 4. Education, 14. Life underwater

Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials

Autori: Dressler, Mareike Kurpisz, Adam de Wolff, Timo a ďalší

Prispievatelia: Dressler, Mareike Kurpisz, Adam de Wolff, Timo a ďalší

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 117
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Foundations of Computational Mathematics, 22 (2)

Predmety: FOS: Computer and information sciences, 90C09, G.1.6, Sum of nonnegative circuit polynomials, Nonnegativity, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Sum of squares Mathematics Subject Classification 14P10, Mathematics - Algebraic Geometry, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Hypercube optimization, 0101 mathematics, Mathematics - Optimization and Control, Algebraic Geometry (math.AG), 14P10, 68Q25, 90C09, nonnegativity certificate, sums of nonnegative circuit polynomials, 68Q25, Certificate, Sum of squares, 16. Peace & justice, sums of squares, Computer Science - Computational Complexity, hypercube optimization, Optimization and Control (math.OC), relative entropy programming, ddc:004

Popis súboru: application/pdf; application/application/pdf

Prístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s10208-021-09496-x.pdf
http://arxiv.org/abs/1802.10004
https://drops.dagstuhl.de/opus/volltexte/2018/9664/pdf/LIPIcs-MFCS-2018-82.pdf
https://link.springer.com/content/pdf/10.1007/s10208-021-09496-x.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1802.html#abs-1802-10004
https://link.springer.com/article/10.1007/s10208-021-09496-x
https://ui.adsabs.harvard.edu/abs/2018arXiv180210004D/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.82
http://hdl.handle.net/20.500.11850/295617
http://hdl.handle.net/20.500.11850/495053

On the star forest polytope for trees and cycles

Autori: Méziane Aı̈der Lamia Aoudia Mourad Baı̈ou a ďalší

Prispievatelia: Méziane Aı̈der Lamia Aoudia Mourad Baı̈ou a ďalší

Zdroj: RAIRO - Operations Research. 53:1763-1773

Predmety: Vehicle Routing Problem and Variants, Disjoint sets, Geometry, dominating set, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Mathematical analysis, 01 natural sciences, Mathematics Subject Classification. 90C27, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Industrial and Manufacturing Engineering, Graph, Engineering, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], star forest, FOS: Mathematics, Graph Labeling and Dimension Problems, polyhedral combinatorics, Minimum weight, facility location, Polytope, Integer programming, 90C10, Discrete mathematics, Vertex (graph theory), Regular polygon, Algorithm, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Parameterized complexity, Computational Theory and Mathematics, 05Cxx Combinatorial optimization, Combinatorics, Computer Science, Physical Sciences, Tree (set theory), Convex hull, Mathematics, Graph Theory and Algorithms, Parameterized Complexity, Star (game theory)

Popis súboru: application/pdf

Prístupová URL adresa: https://www.rairo-ro.org/articles/ro/pdf/2019/05/ro151119.pdf
https://hal.archives-ouvertes.fr/hal-03071987
https://doi.org/10.1051/ro/2018076
https://dblp.uni-trier.de/db/journals/rairo/rairo53.html#AiderABMN19
https://www.rairo-ro.org/articles/ro/pdf/2019/05/ro151119.pdf
https://hal.archives-ouvertes.fr/hal-03071987/document
https://www.rairo-ro.org/articles/ro/abs/2019/05/ro151119/ro151119.html
https://hal.science/hal-03071987v1/document
https://doi.org/10.1051/ro/2018076
https://hal.science/hal-03071987v1

Resolviendo el problema de valores propios complementarios mediante un algoritmo cuasi-Newton.

Alternate Title: Solving the eigenvalue complementarity problem using a quasi-Newton algorithm.

Autori: Arenas, Favián Arias, Carlos Pérez, Rosana

Zdroj: Revista de la Academia Colombiana de Ciencias Exactas, Físicas y Naturales. abr-jun2022, Vol. 46 Issue 179, p325-338. 14p.

Predmety: Complementarity constraints (Mathematics), Nonlinear programming, Nonlinear equations, Research personnel, Algorithms, Physics, Eigenvalues

Minimizing the difference of convex and weakly convex functions via bundle method

Autori: Syrtseva, Ksenia van Ackooij, Wim Demassey, Sophie a ďalší

Prispievatelia: Syrtseva, Ksenia van Ackooij, Wim Demassey, Sophie a ďalší

Zdroj: Pacific Journal of Optimization.

Predmety: Bundle Methods, 65K05, [MATH] Mathematics [math], DC Programming, 7. Clean energy, weakly convex, Non-smooth Optimization, Non-smooth Optimization DC Programming Bundle Methods weakly convex Mathematics Subject Classification: 90C26 65K05 49J52 49J53, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [MATH]Mathematics [math], weakly convex Mathematics Subject Classification: 90C26, 49J52, 49J53

Prístupová URL adresa: https://hal.science/hal-03934581v1

Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system

Autori: Epelman, Marina A. Freund, Robert M. University of Michigan, Industrial and Operations Engineering, 1205 Beal Avenue, Ann Arbor, MI 48109-2117, USA, e-mail: mepelman@umich.edu, US a ďalší

Prispievatelia: Epelman, Marina A. Freund, Robert M. University of Michigan, Industrial and Operations Engineering, 1205 Beal Avenue, Ann Arbor, MI 48109-2117, USA, e-mail: mepelman@umich.edu, US a ďalší

Zdroj: Mathematical Programming. 88:451-485

Predmety: 90C05, Iterative numerical methods for linear systems, ellipsoid method, Science, Numerical computation of matrix norms, conditioning, scaling, partially ordered space, 0211 other engineering and technologies, 02 engineering and technology, 01 natural sciences, Complexity and performance of numerical algorithms, conditioning, iterative method, Numerical solutions to equations with linear operators, interior point method, Linear operators on ordered spaces, 0101 mathematics, Key Words: Complexity of Convex Programming – Conditioning – Error Analysis, computational complexity, algorithm, conic linear systems, normed linear spaces, Legacy, 90C60, Mathematics Subject Classification (1991): 90C, Mathematics, Equations and inequalities involving linear operators, with vector unknowns, condition number

Popis súboru: application/xml; 215133 bytes; 3115 bytes; application/pdf; text/plain

Prístupová URL adresa: http://deepblue.lib.umich.edu/bitstream/2027.42/42344/1/10107-88-3-451_00880451.pdf
https://zbmath.org/1538614
https://doi.org/10.1007/s101070000165
http://dspace.mit.edu/handle/1721.1/5255?show=full
https://core.ac.uk/display/3104372
https://link.springer.com/content/pdf/10.1007/s101070000136.pdf
https://dblp.uni-trier.de/db/journals/mp/mp88.html#EpelmanF00
https://deepblue.lib.umich.edu/handle/2027.42/42344
https://link.springer.com/article/10.1007/s101070000136

How to Measure the Researcher Impact with the Aid of its Impactable Area: A Concrete Approach Using Distance Geometry.

Autori: Cappelletti-Montano, Beniamino Cherchi, Gianmarco Manca, Benedetto a ďalší

Zdroj: Journal of Classification. Mar2025, Vol. 42 Issue 1, p253-281. 29p.

Predmety: Dimensional reduction algorithms, Linear programming, Mathematical programming, Research personnel, Applied mathematics

Artificial Immune System–Negative Selection Classification Algorithm (NSCA) for Four Class Electroencephalogram (EEG) Signals

Autori: Nasir Rashid Javaid Iqbal Fahad Mahmood a ďalší

Zdroj: Front Hum Neurosci
Frontiers in Human Neuroscience, Vol 12 (2018)

Predmety: Artificial intelligence, Cognitive Neuroscience, Neurosciences. Biological psychiatry. Neuropsychiatry, 02 engineering and technology, Speech recognition, artificial immune system (AIS), Pattern recognition (psychology), 7. Clean energy, Epilepsy Detection, brain computer interface (BCI), Cellular and Molecular Neuroscience, EEG Analysis, 03 medical and health sciences, 0302 clinical medicine, genetic algorithm, 0202 electrical engineering, electronic engineering, information engineering, Psychology, Deep Learning for EEG, Neuronal Oscillations in Cortical Networks, Psychiatry, Artificial immune system, Life Sciences, mel frequency cepstral coefficients (MFCC), Electroencephalography, Detector, Neural Interface Technology, electroencephalogram, Brain-Computer Interfaces in Neuroscience and Medicine, Computer science, Dimensionality reduction, Programming language, 3. Good health, Brain–computer interface, FOS: Psychology, Neural Ensemble Physiology, SIGNAL (programming language), Feature selection, staked auto-encoder, Telecommunications, Euclidean distance, RC321-571, Neuroscience

Prístupová URL adresa: https://www.frontiersin.org/articles/10.3389/fnhum.2018.00439/pdf
https://pubmed.ncbi.nlm.nih.gov/30524257
https://doaj.org/article/433e035a591c4734b49f7cbaebdd6409
https://www.frontiersin.org/articles/10.3389/fnhum.2018.00439/full
https://www.frontiersin.org/article/10.3389/fnhum.2018.00439/full
http://europepmc.org/articles/PMC6256735
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6256735
https://pubmed.ncbi.nlm.nih.gov/30524257/

A Technique for Obtaining True Approximations for k-Center with Covering Constraints

Autori: Anegg, Georg Angelidakis, Haris Kurpisz, Adam a ďalší

Prispievatelia: Anegg, Georg Angelidakis, Haris Kurpisz, Adam a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783030457709
Math Program
Mathematical Programming, 192 (1)
Lecture Notes in Computer Science, 12125
Integer Programming and Combinatorial Optimization
Integer Programming and Combinatorial Optimization-21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings
Mathematical Programming
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Integer Programming and Combinatorial Optimization

Predmety: FOS: Computer and information sciences, 90C05, Full Length Paper, Polyhedral techniques, 0211 other engineering and technologies, 68Q25, 68W40, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Approximation algorithms, Clustering, 90C27, 68W40, 68Q25, 90C05, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, k-Center, Data Structures and Algorithms (cs.DS), 0101 mathematics, Mathematics - Optimization and Control, Polyhedral techniques Mathematics Subject Classification 90C27

Popis súboru: application/application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/2007.03946
https://link.springer.com/content/pdf/10.1007/s10107-021-01645-y.pdf
https://pubmed.ncbi.nlm.nih.gov/35300156
http://arxiv.org/abs/2007.03946
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-03946
https://rd.springer.com/chapter/10.1007/978-3-030-45771-6_5
https://link.springer.com/content/pdf/10.1007/s10107-021-01645-y.pdf
https://link.springer.com/article/10.1007/s10107-021-01645-y
https://link.springer.com/content/pdf/10.1007%2F978-3-030-45771-6_5.pdf
https://www.scilit.net/article/78b9848f90c9e5bac2e193d8ba7af6b6
https://dblp.uni-trier.de/db/conf/ipco/ipco2020.html#AneggAKZ20
https://doi.org/10.1007/978-3-030-45771-6_5
http://hdl.handle.net/20.500.11850/487714
http://hdl.handle.net/20.500.11850/465506

Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

Autori: Verma, Sushil Dessouky, Maged

Zdroj: Mathematics of Operations Research, 1998 Nov 01. 23(4), 930-943.

Prístupová URL adresa: https://www.jstor.org/stable/3690639

Anna: an open-source platform for real-time integration of machine learning classifiers with veterinary electronic health records.

Autori: Kong, Chun Yin Vasquez, Picasso Farhoodimoghadam, Makan a ďalší

Zdroj: BMC Veterinary Research. 10/2/2025, Vol. 21 Issue 1, p1-12. 12p.

Predmet: Machine learning, Electronic health records, Open source software, Patient care, Veterinary medicine, Diagnosis, Classification algorithms, Synchronization

Riemannian classification of single-trial surface EEG and sources during checkerboard and navigational images in humans.

Autori: Simar, Cédric Petit, Robin Bozga, Nichita a ďalší

Zdroj: PLoS ONE; 1/14/2022, Vol. 17 Issue 1, p1-22, 22p

Predmety: VISUAL evoked potentials, EVOKED potentials (Electrophysiology), RIEMANNIAN geometry, CLASSIFICATION algorithms, ELECTROENCEPHALOGRAPHY, BRAIN-computer interfaces

Online BCI systems: cross-subject motor imagery classification based on weighted time-domain feature extraction methods.

Autori: Yang, Cheng Wang, Shiyu Peng, Yiteng a ďalší

Zdroj: Journal of Engineering Design; Jun2024, Vol. 35 Issue 6, p685-708, 24p

Predmety: MOTOR imagery (Cognition), FEATURE extraction, BRAIN-computer interfaces, SUPPORT vector machines, CLASSIFICATION

Modified Proximal point algorithms for finding a zero point of maximal monotone operators, generalized mixed equilibrium problems and variational inequalities

Autori: Kriengsak Wattanawitoon Poom Kumam

Zdroj: Journal of Inequalities and Applications. 2012

Predmety: Best Proximity Points, Convex Optimization, Economics, Geometry, Set (abstract data type), Fixed-Point Problems, Space (punctuation), Mathematical analysis, 01 natural sciences, Fixed Point Theorems in Metric Spaces, Point (geometry), FOS: Mathematics, Discrete Mathematics and Combinatorics, 0101 mathematics, Economic growth, Variational inequality, Numerical Analysis, Banach space, Numerical Optimization Techniques, Fixed Point Theorems, Applied Mathematics, Zero (linguistics), Pure mathematics, Linguistics, Iterative Algorithms for Nonlinear Operators and Optimization, Fixed point, Discrete mathematics, Applied mathematics, Computer science, FOS: Philosophy, ethics and religion, Programming language, Philosophy, Computational Theory and Mathematics, Strongly monotone, Computer Science, Physical Sciences, Convergence (economics), FOS: Languages and literature, Monotone polygon, Geometry and Topology, Analysis, Mathematics, Mathematics Subject Classification, Mixed-Integer Nonlinear Programs

Prístupová URL adresa: https://journalofinequalitiesandapplications.springeropen.com/track/pdf/10.1186/1029-242X-2012-118
https://journalofinequalitiesandapplications.springeropen.com/articles/10.1186/1029-242X-2012-118
https://link.springer.com/article/10.1186/1029-242X-2012-118
https://link.springer.com/article/10.1186/1029-242X-2012-118/fulltext.html
https://link.springer.com/content/pdf/10.1186%2F1029-242X-2012-118.pdf
https://paperity.org/p/56385413/modified-proximal-point-algorithms-for-finding-a-zero-point-of-maximal-monotone-operators

Local certification of graphs with bounded genus

Autori: Feuilloley, Laurent Fraigniaud, Pierre Montealegre, Pedro a ďalší

Prispievatelia: Feuilloley, Laurent Fraigniaud, Pierre Montealegre, Pedro a ďalší

Zdroj: Discrete Applied Mathematics. 325:9-36

Predmety: FOS: Computer and information sciences, [INFO.INFO-DC]Computer Science [cs]/Distributed, 0102 computer and information sciences, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], 2012 ACM Subject Classification D.1.3 Concurrent Programming (Distributed programming), Computer Science - Distributed, Parallel, and Cluster Computing, proof-labeling scheme, Local certification, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], locally checkable proofs, Distributed, Parallel, and Cluster Computing (cs.DC), 0101 mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2007.08084

Optimización de rutas de transporte en una empresa del sector utilities

Autori: Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa NTT Data Spain Enesco Garrido, Marta a ďalší

Témy: Àrees temàtiques de la UPC::Matemàtiques i estadística, Transportation -- Planning, Genetic algorithms, Programming (Mathematics), Programación lineal entera mixta, Algoritmos genéticos, CVRP., Transport -- Planificació, Algorismes genètics, Programació (Matemàtica), Classificació AMS::90 Operations research, mathematical programming::90B Operations research and management science, Classificació AMS::68 Computer science::68T Artificial intelligence, Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming, Master thesis

URL: http://hdl.handle.net/2117/424615