Výsledky vyhledávání - F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems~
-
1
Autoři: a další
Zdroj: 2018 IEEE Pacific Visualization Symposium (PacificVis). :1-10
Témata: Graph/Network Data, Geometry based Techniques, 11. Sustainability, Folding, Linear layouts, F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems, 0102 computer and information sciences, Routing and layout, 01 natural sciences
Přístupová URL adresa: https://research.tue.nl/en/publications/2e370ddf-e3bd-4d42-87f7-53d8bb312fdf
https://research.tue.nl/en/publications/optimal-algorithms -for-compact-linear-layouts-2
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ff550cf2b-aef8-4e45-ac94-300fb43ddd2c
https://ieeexplore.ieee.org/document/8365970/
https://dblp.uni-trier.de/db/conf/apvis/pacificvis2018.html#SonkeVMVS18
http://doi.ieeecomputersociety.org/10.1109/PacificVis.2018.00010 -
2
Autoři:
Přispěvatelé:
Témata: Schedules, lazy pattern matching, rule based languages. CR Subject Classification, E.1 [Data Structures, F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems — Pattern, F.2.2 [Analysis of Algorithms and Problem Complexity
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5474; http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf
-
3
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783540200642
Témata: FOS: Computer and information sciences, 0301 basic medicine, Data structures, J.3, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, G.2.1, data structure, 0102 computer and information sciences, F.2.2, I.1.2, 01 natural sciences, 03 medical and health sciences, slope selection, sequence algorithm, Computer graphics, computational geometry (digital and algorithmic aspects), Computer Science - Data Structures and Algorithms, computational geometry, Analysis of algorithms, Data Structures and Algorithms (cs.DS), Computational methods for problems pertaining to biology, Nonnumerical algorithms, maximum-density segment, biological sequence analysis, Combinatorics in computer science, bioinformatics, Protein sequences, DNA sequences, Computer Science - Discrete Mathematics
Popis souboru: application/xml; application/pdf; 209454 bytes
Přístupová URL adresa: http://ntur.lib.ntu.edu.tw/bitstream/246246/200340/1/92.pdf
http://arxiv.org/abs/cs/0311020
https://zbmath.org/2135841
https://doi.org/10.1137/s0097539704440430
https://core.ac.uk/display/2419390
https://link.springer.com/10.1007/978-3-540-39658-1_15
https://link.springer.com/chapter/10.1007/978-3-540-39658-1_15
https://rd.springer.com/chapter/10.1007/978-3-540-39658-1_15
https://dblp.uni-trier.de/db/conf/esa/esa2003.html#ChungL03
https://arxiv.org/abs/cs/0311020
https://arxiv.org/pdf/cs/0311020.pdf -
4
Autoři:
Zdroj: ACM Transactions on Algorithms. 4:1-18
Témata: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problemsâ€'Sorting and searching, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy
Popis souboru: application/pdf
-
5
Autoři: a další
Přispěvatelé: a další
Témata: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, F.1.2 [Computation by Abstract Devices, Modes of Computation|Online computation, J.4 [Social and Behavioral Sciences, Economics Keywords, crowdsourcing, principal-agent, dynamic pricing, multi-armed bandits, regret
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.5081; http://www.jennwv.com/papers/dynamicpa.pdf
-
6
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Optimality proofs, Tower of Hanoi ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2358; http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf
-
7
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph Theory—Graph labeling, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Design, Experimentation Additional Key Words and Phrases, Approximation algorithms, graph labeling
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.4836; http://www.dcc.unicamp.br/~fkm/publication/jea05.pdf
-
8
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory
Popis souboru: application/pdf
-
9
Autoři:
Přispěvatelé:
Témata: Discrete event, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.4 [Algorithm Analysis, Efficiency
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.8866; http://www.cis.ufl.edu/~jhelms/TOMACS/articles/v6n3/KrantzAnalysis.ps.gz
-
10
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Témata: General Terms, Algorithms Additional Key Words and Phrases, String algorithms, approximation algorithms
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9320; http://matsrv.math.cas.cz/~sgall/ps/strings.ps
-
11
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.9362; http://www.cs.uwaterloo.ca/~tmchan/nearlin_stoc.ps
-
12
Autoři:
Přispěvatelé:
Zdroj: http://algo.epfl.ch/~osven/Ola Svensson_publications/JACM11.pdf.
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms, Algorithms, Theory Additional Key Words and Phrases, Job shop scheduling, hardness of approximation, machine scheduling ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.4865; http://algo.epfl.ch/~osven/Ola Svensson_publications/JACM11.pdf
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.4865
http://algo.epfl.ch/~osven/Ola Svensson_publications/JACM11.pdf -
13
Autoři:
Zdroj: Journal of Algorithms. 54:168-204
Témata: \(H\)-distance, FOS: Computer and information sciences, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Girsanov theorem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Heat measures, Loop groups, Coloring of graphs and hypergraphs, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Data Structures and Algorithms (cs.DS), Wasserstein distance, F.2.2, Nonnumerical algorithms, Constraint Satisfaction
Popis souboru: application/xml
Přístupová URL adresa: http://arxiv.org/pdf/cs/0006046
http://arxiv.org/abs/cs/0006046
https://dl.acm.org/doi/10.5555/1061279.1061282
https://arxiv.org/pdf/cs/0006046v1
https://arxiv.org/abs/cs/0006046
https://dblp.uni-trier.de/db/journals/corr/corr0006.html#cs-DS-0006046
https://www.sciencedirect.com/science/article/abs/pii/S0196677404001117
https://ui.adsabs.harvard.edu/abs/2000cs........6046B/abstract
https://doi.org/10.1016/j.jalgor.2004.06.008
https://arxiv.org/pdf/cs/0006046v1
https://export.arxiv.org/abs/cs/0006046
https://arxiv.org/abs/cs/0006046 -
14
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8779; http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps
-
15
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors H.2.3 [Database management systems, Languages— query languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms, Theory Keywords XPath, trees, satisfiability
Popis souboru: application/pdf
-
16
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Steiner network problem, prize-collecting, edge-connectivity, vertexconnectivity, all-or-nothing flows ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3699; http://crab.rutgers.edu/~guyk/pub/pc/nabs.pdf
-
17
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Témata: General Terms, Algorithms, Experimentation Additional Key Words and Phrases, Linear Programming, Integer Programming
Popis souboru: application/postscript
-
18
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory Additional Key Words and Phrases, Kernelization, Lower Bounds, Max-Leaf Spanning Tree, Out-Branching, Parameterized Algorithms ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7957; http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf
-
19
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory Additional Key Words and Phrases, Exponential-time algorithm, exact algorithm, constraint satisfaction, discrete optimization, partition function, generating function
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.7666; http://people.maths.ox.ac.uk/~scott/Papers/counting.pdf
-
20
Autoři: a další
Přispěvatelé: a další
Témata: General Terms Algorithms, Performance, Theory Keywords Ad-Hoc Networks, Face Routing, Flooding, Geometric Routing, Mobile Computing, Modeling, Unit Disk Graphs, Wireless Communication
Popis souboru: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder