Search Results - "Optimal-time algorithm"
-
1
Authors:
Source: Twentieth Anniversary Volume: ISBN: 9780387873626
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Access URL: https://link.springer.com/content/pdf/10.1007%2Fs00454-007-9031-0.pdf
https://link.springer.com/10.1007/s00454-007-9031-0
https://dblp.uni-trier.de/db/journals/dcg/dcg39.html#SchreiberS08
https://link.springer.com/content/pdf/10.1007%2Fs00454-007-9031-0.pdf
https://link.springer.com/article/10.1007/s00454-007-9031-0
http://www.math.tau.ac.il/~michas/fp010-schreiber.pdf
https://dblp.uni-trier.de/db/conf/compgeom/compgeom2006.html#SchreiberS06
https://core.ac.uk/display/20757027
https://rd.springer.com/chapter/10.1007/978-0-387-87363-3_27
http://www.cs.tau.ac.il/~michas/fp010-schreiber.pdf
http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/ACM%20SoCG/2006/An%20Optimal-Time %20Algorithm%20for%20Shortest%20Paths%20on%20a%20Convex%20Polytope%20in%20Three%20Dimensions.pdf -
2
Authors: Kimmel, Ron
File Description: application/pdf
-
3
Authors: Yevgeny Schreiber
Source: Discrete & Computational Geometry. 43:21-53
Subject Terms: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences
Access URL: https://link.springer.com/content/pdf/10.1007%2Fs00454-009-9136-8.pdf
https://link.springer.com/article/10.1007/s00454-009-9136-8
https://link.springer.com/10.1007/s00454-009-9136-8
https://dblp.uni-trier.de/db/journals/dcg/dcg43.html#Schreiber10
https://link.springer.com/content/pdf/10.1007%2Fs00454-009-9136-8.pdf
https://doi.org/10.1007/s00454-009-9136-8 -
4
Authors:
Source: Information Sciences. 238:212-220
-
5
Authors: Zemliak, A. M.
Source: Radioelectronics and Communications Systems; Том 55, № 11 (2012); 506-513
Subject Terms: analog circuit, Lyapunov function, quasi-optimal design strategy, Kirchhoff laws, traditional optimization strategy, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
File Description: application/pdf
-
6
Authors:
Source: 2010 International Symposium on Intelligence Information Processing and Trusted Computing. :161-164
Subject Terms: 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 01 natural sciences
-
7
Authors: et al.
Source: SIAM Journal on Computing. 18:792-810
Subject Terms: Information storage and retrieval of data, Analysis of algorithms and problem complexity, slope selection, computational geometry, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Searching and sorting, 01 natural sciences, parametric search
File Description: application/xml
Access URL: https://dl.acm.org/doi/10.1137/0218055
https://epubs.siam.org/doi/abs/10.1137/0218055
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp18.html#ColeSSS89
https://nyuscholars.nyu.edu/en/publications/optimal -time -algorithm -for-slope-selection
https://www.researchwithrutgers.com/en/publications/optimal -time -algorithm -for-slope-selection
https://doi.org/10.1137/0218055 -
8
Authors: et al.
Source: Systems and Computers in Japan. 17:56-65
Subject Terms: 0102 computer and information sciences, 01 natural sciences
-
9
Authors:
Source: Discrete Applied Mathematics. 17:67-105
Subject Terms: Connectivity, rooted trees, augmentation problem, Applied Mathematics, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, k-vertex-connectivity, rooted directed trees, 01 natural sciences
File Description: application/xml
-
10
Authors: et al.
Contributors: et al.
Source: BIT. 28:353-356
Subject Terms: dynamic programming, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, 4. Education, time optimal, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, maximum weight independent set in trees, 16. Peace & justice, 01 natural sciences, 7. Clean energy
File Description: application/xml
-
11
Authors:
Contributors:
Source: http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/ACM SoCG/2006/An Optimal Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions.pdf.
File Description: application/pdf
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.4346
http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/ACM SoCG/2006/An Optimal Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions.pdf -
12
Authors: Yevgeny Schreiber1
Source: Discrete & Computational Geometry. Mar2008, Vol. 39 Issue 1-3, p500-579. 80p. 47 Diagrams.
Subject Terms: *ALGORITHMS, *CONVEX polytopes, *POLYTOPES, *ALGEBRA
-
13
Authors:
Contributors:
File Description: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.2456; http://www.cs.technion.ac.il/~ron/PAPERS/fsfs.tr.ps.gz
-
14
Authors: et al.
Source: Systems & Computers in Japan. Mar86, Vol. 17 Issue 3, p56-65. 10p.
Subject Terms: Algorithms, Computer programming, Ternary system, Number systems, Digital electronics, Computer systems
-
15
Additional Titles: The optimal time algorithm for the k-node-connectivity augmentation problem for directed ternary trees
Index Terms: Journal Article., VoR.
-
16
Additional Titles: The optimal time algorithm for the k-node-connectivity augmentation problem for directed ternary trees
Index Terms: VoR
-
17
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783031221040
Subject Terms: FOS: Computer and information sciences, Eulerian and Hamiltonian graphs, simple paths, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Programming involving graphs or networks, 01 natural sciences, optimal-time algorithm, Graph theory (including graph drawing) in computer science, rectangular grid graphs, lower bound, solution-space graph, reconfiguration algorithm, Hamiltonian paths, Computer Science - Discrete Mathematics
File Description: application/xml
Access URL: http://arxiv.org/abs/2205.08025
-
18
Authors:
Source: Twentieth Anniversary Volume: ; page 1-80 ; ISBN 9780387873626 9780387873633
-
19
Authors: Schreiber, Yevgeny
Source: Discrete & Computational Geometry; Jan2010, Vol. 43 Issue 1, p21-53, 33p, 21 Diagrams
Subject Terms: ALGORITHMS, POLYHEDRA, EUCLIDEAN algorithm, POLYTOPES, RIEMANN surfaces, GEODESICS
-
20
Authors:
Source: Proceedings of the Twenty-Second Annual Symposium: Computational Geometry; 6/ 5/2006, p30-39, 10p
Nájsť tento článok vo Web of Science 
Full Text Finder