Výsledky vyhledávání - "online approximation algorithm"
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: IEEE Access, Vol 5, Pp 2514-2533 (2017)
Témata: FOS: Computer and information sciences, Technology, mobile edge-cloud, online approximation algorithm, mobile edge-cloud (MEC), 02 engineering and technology, Computer Science - Networking and Internet Architecture, Engineering, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Cloud computing, Data Structures and Algorithms (cs.DS), optimization theory, Mathematics - Optimization and Control, Networking and Internet Architecture (cs.NI), Science & Technology, Computer Science, Information Systems, Engineering, Electrical & Electronic, graph mapping, TK1-9971, Computer Science - Distributed, Parallel, and Cluster Computing, Optimization and Control (math.OC), Computer Science, Telecommunications, Electrical & Electronic, Electrical engineering. Electronics. Nuclear engineering, Distributed, Parallel, and Cluster Computing (cs.DC), Information Systems
Přístupová URL adresa: http://arxiv.org/abs/1605.08023
https://doaj.org/article/9742876b0dc2481cbe78d5ccd30ab16b
http://dblp.uni-trier.de/db/journals/corr/corr1605.html#WangZL16
https://128.84.21.199/abs/1605.08023
https://arxiv.org/abs/1605.08023
https://ieeexplore.ieee.org/document/7847322/
https://arxiv.org/pdf/1605.08023.pdf
http://ieeexplore.ieee.org/document/7847322/
http://hdl.handle.net/10044/1/44349 -
2
Autoři: a další
Zdroj: Proceedings of the Annual Conference of JSAI. 2021, :2
-
3
Autoři:
Zdroj: RAIRO - Operations Research. 39:163-183
Témata: Combinatorial optimization, bin covering problem, online approximation algorithm, 0211 other engineering and technologies, Inventory, storage, reservoirs, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Approximation algorithms, bin packing problem, uniform sized bins, asymptotic worst case ratio, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), longest item
Popis souboru: application/xml
-
4
Autoři:
Zdroj: Journal of Automata, Languages and Combinatorics. 8(4):663-674
Témata: Combinatorial optimization, bin packing problem, bin covering problem, uniform sized bins, online approximation algorithm, asymptotic worst case ratio, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), longest item, Approximation methods and heuristics in mathematical programming, 7. Clean energy, Approximation algorithms
Popis souboru: application/xml
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: 2015 IEEE International Conference on Communications (ICC).
Témata: wireless networks, FOS: Computer and information sciences, Technology, MIGRATION, Theory & Methods, online approximation algorithm, resource allocation, 0805 Distributed Computing, 02 engineering and technology, Computer Science - Networking and Internet Architecture, Engineering, Computer Science, Theory & Methods, 1005 Communications Technologies, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Cloud computing, Mathematics - Optimization and Control, Networking and Internet Architecture (cs.NI), Science & Technology, 0803 Computer Software, Engineering, Electrical & Electronic, 16. Peace & justice, NETWORKS, Computer Science - Distributed, Parallel, and Cluster Computing, Optimization and Control (math.OC), Computer Science, Electrical & Electronic, fog/edge computing, Distributed, Parallel, and Cluster Computing (cs.DC), Distributed Computing, optimization
Přístupová URL adresa: http://arxiv.org/pdf/1503.02735
http://arxiv.org/abs/1503.02735
https://ieeexplore.ieee.org/document/7557016/
https://doi.org/10.1109/TPDS.2016.2604814
http://ieeexplore.ieee.org/document/7557016
https://www.computer.org/csdl/journal/td/2017/04/07557016/13rRUxOdD2l
https://dl.acm.org/doi/10.1109/TPDS.2016.2604814
https://pennstate.pure.elsevier.com/en/publications/dynamic-service-placement-for-mobile-micro-clouds-with-predicted--3
https://arxiv.org/abs/1503.02735
http://export.arxiv.org/pdf/1503.02735
http://ui.adsabs.harvard.edu/abs/2015arXiv150302735W/abstract
https://arxiv.org/pdf/1503.02735.pdf
https://ieeexplore.ieee.org/document/7249199/
http://dblp.uni-trier.de/db/journals/corr/corr1503.html#WangUCHZL15
https://www.commsp.ee.ic.ac.uk/~sw4410/papers/WS_ICC2015.pdf
http://ieeexplore.ieee.org/document/7249199/
http://www.commsp.ee.ic.ac.uk/~sw4410/papers/WS_ICC2015.pdf
https://pennstate.pure.elsevier.com/en/publications/dynamic-service-placement-for-mobile-micro-clouds-with-predicted--2
http://hdl.handle.net/10044/1/69229 -
6
Autoři:
Témata: Online approximation algorithm, Asymptotic worst case ratio, Bin packing problem, Longest item, Uniform sized bins, Variable sized bins
Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005; http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/53538; vital:1463
-
7
Přispěvatelé:
Témata: bin packing problem, bin covering problem, uniform sized bins, online approximation algorithm, asymptotic worst case ratio, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, longest item, 01 natural sciences
Přístupová URL adresa: https://hdl.handle.net/1959.8/87921
-
8
Autoři: a další
Přispěvatelé: a další
Zdroj: 1016 ; 1002
Témata: Science & Technology, Technology, Computer Science, Theory & Methods, Engineering, Electrical & Electronic, Cloud computing, fog/edge computing, online approximation algorithm, optimization, resource allocation, wireless networks, MIGRATION, NETWORKS, 0803 Computer Software, 0805 Distributed Computing, 1005 Communications Technologies, Distributed Computing
Relation: IEEE Transactions on Parallel and Distributed Systems; http://hdl.handle.net/10044/1/69229; PO4603106973
-
9
-
10
Autoři: a další
Zdroj: IEEE Transactions on Parallel & Distributed Systems; Apr2017, Vol. 28 Issue 4, p1002-1016, 15p
-
11
Autoři:
Zdroj: Constructive Approximation. Nov2025, p1-28.
Témata: *ONLINE algorithms, *REPRODUCING kernel (Mathematics), *ITERATIVE methods (Mathematics), *FUNCTION spaces, *VECTOR valued functions, *APPROXIMATION algorithms, *SMOOTHNESS of functions, *MEAN square algorithms
People: HILBERT, David, 1862-1943
-
12
Autoři: a další
Zdroj: Cluster Computing; Oct2025, Vol. 28 Issue 10, p1-20, 20p
-
13
Autoři: a další
Zdroj: IISE Transactions; Oct2025, Vol. 57 Issue 10, p1198-1214, 17p
-
14
Autoři:
Zdroj: IEEE Journal on Selected Areas in Communications; Jun2020, Vol. 38 Issue 6, p1089-1101, 13p
-
15
-
16
Autoři: a další
Zdroj: European Journal of Operational Research. Nov2023, Vol. 310 Issue 3, p1218-1233. 16p.
-
17
Autoři: a další
Zdroj: Future Internet; Jul2025, Vol. 17 Issue 7, p300, 19p
-
18
Autoři: a další
Zdroj: IEEE Journal on Selected Areas in Communications; Aug2018, Vol. 36 Issue 8, p1751-1767, 17p
-
19
Autoři: a další
Zdroj: Israel Journal of Mathematics; Aug2017, Vol. 221 Issue 1, p445-469, 25p
-
20
Max Contribution: An Online Approximation of Optimal Resource Allocation in Delay Tolerant Networks.
Autoři: a další
Zdroj: IEEE Transactions on Mobile Computing; Mar2015, Vol. 14 Issue 3, p592-605, 14p
Full Text Finder
Nájsť tento článok vo Web of Science