Suchergebnisse - "Complexity analysis of algorithms"

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

Autoren: Kameng Nip Zhenbo Wang

Quelle: Journal of Scheduling. 26:543-558

Schlagwörter: 8. Economic growth, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://link.springer.com/article/10.1007/s10951-021-00677-8

Regional complexity analysis of algorithms for nonconvex smooth optimization

Autoren: Frank E. Curtis Daniel P. Robinson

Quelle: Mathematical Programming. 187:579-615

Schlagwörter: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Zugangs-URL: http://arxiv.org/pdf/1802.01062
http://arxiv.org/abs/1802.01062
http://ui.adsabs.harvard.edu/abs/2018arXiv180201062C/abstract
https://link.springer.com/article/10.1007/s10107-020-01492-3
https://doi.org/10.1007/s10107-020-01492-3
https://dblp.uni-trier.de/db/journals/mp/mp187.html#CurtisR21

On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms

Autoren: M. D. Mabula Oscar Valero Juan-José Miñana

Quelle: Trends in Mathematics ISBN: 9783030709730

Zugangs-URL: https://link.springer.com/chapter/10.1007/978-3-030-70974-7_13

A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms

Autoren: Oscar Valero Zahra Mohammadi

Quelle: Topology and its Applications. 203:42-56

Schlagwörter: 0101 mathematics, 01 natural sciences

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0166864115006070

Complexity analysis of algorithms by recognition of their classification properties

Autoren: A. B. Vinokur G. P. Kozhevnikova

Quelle: Cybernetics and Systems Analysis. 27:840-852

Schlagwörter: classification, Analysis of algorithms and problem complexity, Pattern recognition, speech recognition, pattern recognition, 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, 01 natural sciences, complexity analysis of algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1007/BF01246515
https://link.springer.com/content/pdf/10.1007/BF01246515.pdf

Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms

Autoren: VYAVAHARE, P LIMAYE, N MANJUNATH, D

Quelle: IEEE/ACM Transactions on Networking. 24:2019-2032

Schlagwörter: System, FOS: Computer and information sciences, Broadcast Network, Operator Placement, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Time, Computer Science - Distributed, Parallel, and Cluster Computing, In-Network Function Computation, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), Wireless Sensor Networks, Energy Complexity, Graph Embedding

Zugangs-URL: http://arxiv.org/pdf/1401.2518
http://arxiv.org/abs/1401.2518
https://ieeexplore.ieee.org/document/7174553/
http://ieeexplore.ieee.org/document/7174553/
https://dblp.uni-trier.de/db/journals/ton/ton24.html#VyavahareLM16

Complexity analysis and algorithms for the Inter Cell Interference Coordination with fixed transmit powers problem

Autoren: Gaurav S. Kasbekar Ashwathi Nambiar

Quelle: 2015 7th International Conference on Communication Systems and Networks (COMSNETS). :1-8

Schlagwörter: 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://ieeexplore.ieee.org/document/7098673/
https://dblp.uni-trier.de/db/conf/comsnets/comsnets2015.html#NambiarK15

Complexity analysis and algorithms for the Program Download Problem

Autoren: Chao Peng Binhai Zhu Jie Zhou et al.

Quelle: Journal of Combinatorial Optimization. 29:216-227

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://ideas.repec.org/a/spr/jcomop/v29y2015i1d10.1007_s10878-013-9702-0.html
https://dblp.uni-trier.de/db/journals/jco/jco29.html#PengZZZ15
https://link.springer.com/article/10.1007%2Fs10878-013-9702-0
https://link.springer.com/content/pdf/10.1007%2Fs10878-013-9702-0.pdf

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces

Autoren: Romaguera Bonilla, Salvador Tirado Peláez, Pedro Valero Sierra, Óscar et al.

Weitere Verfasser: Romaguera Bonilla, Salvador Tirado Peláez, Pedro Valero Sierra, Óscar et al.

Quelle: RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Universitat Politècnica de València (UPV)
instname

Schlagwörter: Improver, Quasi-metric, 02 engineering and technology, 01 natural sciences, Worsener, Largetwo, Complexity class, Hanoi, Fixed Point, 0202 electrical engineering, electronic engineering, information engineering, Quicksort, 0101 mathematics, Complexity space, MATEMATICA APLICADA

Dateibeschreibung: application/pdf

Zugangs-URL: https://riunet.upv.es/bitstream/10251/46842/2/IJCM-CMMSE2011.pdf
https://riunet.upv.es/handle/10251/46842
https://riunet.upv.es/handle/10251/46842?show=full
https://riunet.upv.es/bitstream/10251/46842/2/IJCM-CMMSE2011.pdf
https://dblp.uni-trier.de/db/journals/ijcm/ijcm89.html#RomagueraTV12a

Scott’s Qualitative Fixed Point Technique in Complexity Analysis of Algorithms

Autoren: Oscar Valero Maria Lopez-Ramirez

Quelle: Advances in Computer Sciences. 1

Schlagwörter: 4. Education, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, 7. Clean energy

Zugangs-URL: https://www.boffinaccess.com/open-access-journals/advances-in-computer-sciences/acs-1-101.pdf
https://www.boffinaccess.com/open-access-journals/advances-in-computer-sciences/scott-qualitative-acs-1-101

Complexity analysis of algorithms: A case study on bioinformatics tools

Autoren: Adonney Allan de Oliveira Veras

Quelle: World Journal of Biology and Biotechnology. 6:11

Schlagwörter: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences

Zugangs-URL: https://sciplatform.com/index.php/wjb/article/download/445/pdf

Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms

Autoren: Vyavahare, Pooja Limaye, Nutan Manjunath, D.

Index Begriffe: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1401.2518

Complexity Analysis and Algorithms for Optimal Resource Allocation in Wireless Networks

Autoren: MINNESOTA UNIV MINNEAPOLIS OFFICE SPONSORED PROJECTS ADMINISTRATION Luo, Zhi-Quan

Quelle: DTIC

Index Begriffe: Radio Communications, WIRELESS COMMUNICATIONS, ALGORITHMS, BEAM FORMING, FREQUENCY ALLOCATION, INTERFERENCE, OPTIMIZATION, COMPLEXITY, INTERFERENCE MANAGEMENT, PE611102, Text

URL: https://apps.dtic.mil/docs/citations/ADA579191

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces

Autoren: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada Ministerio de Ciencia e Innovación Romaguera Bonilla, Salvador et al.

Index Begriffe: Quasi-metric, Complexity space, Fixed Point, Improver, Worsener, Complexity class, Quicksort, Hanoi, Largetwo, MATEMATICA APLICADA, info:eu-repo/semantics/article

URL: http://hdl.handle.net/10251/46842

Complexity Analysis and Algorithms for Optimal Resource Allocation in Wireless Networks

Autoren: Zhi-Quan Luo

Schlagwörter: 12. Responsible consumption

Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product: Error complexity analysis of algorithms for matrix multiplication and matrix chain product

Autoren: Nai-Kuan Tsao

Quelle: IEEE Transactions on Computers. :758-771

Schlagwörter: Strassen's algorithm, floating-point arithmetic, Analysis of algorithms and problem complexity, Other matrix algorithms, 0202 electrical engineering, electronic engineering, information engineering, data complexity, Winograd's algorithm, 0102 computer and information sciences, 02 engineering and technology, Algorithms in computer science, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001675694
https://ieeexplore.ieee.org/document/1675694/
https://www.computer.org/csdl/trans/tc/1981/10/01675694.pdf
https://dblp.uni-trier.de/db/journals/tc/tc30.html#Tsao81

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints.

Autoren: Nip, Kameng Wang, Zhenbo

Quelle: Journal of Scheduling; Dec2023, Vol. 26 Issue 6, p543-558, 16p

Schlagwörter: FLOW shop scheduling, PRODUCTION scheduling, POLYNOMIAL time algorithms, APPROXIMATION algorithms, ALGORITHMS, SCHEDULING, FLOW shops, WORKING hours, SHIFT systems

Weak topologies on asymmetric normed linear spaces and non-asymptotic criteria in the theory of complexity analysis of algorithms

Autoren: García-Raffi, L. M. Romaguera, S. Sánchez Pérez, E. A.

Schlagwörter: Normed linear spaces and Banach spaces, Banach lattices, Metric spaces, metrizability, Analysis of algorithms and problem complexity

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2147519

Average Case Complexity Analysis of Algorithms for the Linear Assignment Problem

Autoren: Tor Sørevik The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Tor Sørevik The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.ii.uib.no/~tors/papers/NOAS.ps.

Schlagwörter: Linear Assignment Problem, Average Case Analysis, Augmenting Path Algorithms

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2830; http://www.ii.uib.no/~tors/papers/NOAS.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2830
http://www.ii.uib.no/~tors/papers/NOAS.ps

Regional complexity analysis of algorithms for nonconvex smooth optimization.

Autoren: Curtis, Frank E. Robinson, Daniel P.

Quelle: Mathematical Programming; May2021, Vol. 187 Issue 1/2, p579-615, 37p

Schlagwörter: NONSMOOTH optimization, VALUATION of real property, FUNCTION spaces, ALGORITHMS, DIFFERENTIAL inclusions