Suchergebnisse - Nonnumerical Algorithms AND Problems – Computations on discrete structures. General Terms
-
1
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: 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
-
2
Autoren:
Weitere Verfasser:
Schlagwörter: 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
Dateibeschreibung: 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
-
3
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: 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
-
4
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph theory—Network problems, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Performance Keywords, computational topology, combinatorial optimization Errors, like straws, upon the surface flow, He who would search for pearls must dive below
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.1370; http://mathcs.slu.edu/~chambers/papers/surflow.pdf
-
5
Autoren:
Weitere Verfasser:
Schlagwörter: 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 Keywords, computational topology, multidimensional analysis, persistent
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1620; http://comptop.stanford.edu/preprints/multidimensional.pdf
-
6
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, E.3 [Data Encryption, Public-key Cryptosystems, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Complexity hierarchies, Relations among complexity classes, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Theory, Security, Algorithms Additional Key Words and Phrases, complexity theory, public-key cryptography, secret-key agreement, digital signatures, interactive proof systems, zero-knowledge protocols, one-way functions
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.6969; http://arxiv.org/pdf/cs/0111056v2.pdf
-
7
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems–Computations on discrete structures General Terms, Algorithms, Performance, Theory Additional Key Words and Phrases, Approximation ratio, set cover
Dateibeschreibung: application/pdf
-
8
Autoren: Kevin Knight
Quelle: ACM Computing Surveys. 21:93-124
Schlagwörter: Artificial intelligence, Data structures, algebraic manipulation, type inference, unification, Analysis of algorithms and problem complexity, higher order logic, occur check, 0102 computer and information sciences, 02 engineering and technology, computations on discrete structures, 01 natural sciences, logic programming, theorem proving, infinite terms, 0202 electrical engineering, electronic engineering, information engineering, inheritance, natural language processing, analysis of algorithms and problem complexity, nonnumerical algorithms and problems, generalization, graphs, computational complexity, Natural language processing, resolution, parallel algorithms, artificial intelligence, prolog, pattern matching, lattices, equational theories, Theorem proving (deduction, resolution, etc.)
Dateibeschreibung: application/xml
Zugangs-URL: https://zbmath.org/4110162
https://doi.org/10.1145/62029.62030
http://www.cse.buffalo.edu/~rapaport/675w/p93-knight.pdf
https://core.ac.uk/display/24451474
http://portal.acm.org/citation.cfm?id=62030
https://www.isi.edu/natural-language/people/unification-knight.pdf
https://dblp.uni-trier.de/db/journals/csur/csur21.html#Knight89
https://dl.acm.org/doi/pdf/10.1145/62029.62030 -
9
Autoren:
Weitere Verfasser:
Quelle: http://www.hpl.hp.com/personal/Robert_Schreiber/papers/2004 Barrier Minimization in Loop Nests/ppopp/Final Version/ppopp barriers.pdf.
Schlagwörter: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Computations on discrete structures General Terms Algorithms, Languages, Theory Keywords Barrier synchronization, circular arc graph, nested circular interval graph, SPMD code, nested loops
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9098; http://www.hpl.hp.com/personal/Robert_Schreiber/papers/2004 Barrier Minimization in Loop Nests/ppopp/Final Version/ppopp barriers.pdf
Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9098
http://www.hpl.hp.com/personal/Robert_Schreiber/papers/2004 Barrier Minimization in Loop Nests/ppopp/Final Version/ppopp barriers.pdf -
10
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors H.2.8 [Database Management, Database Applications—data mining, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures General Terms Algorithms, Experimentation, Performance
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.8262; http://www.cs.duke.edu/~pankaj/publications/papers/traj.pdf
-
11
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, D.2.4 [Software Engineering, Software/Program Verification, F.2.2 [analysis of algorithms and problem complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory, Verification Additional Key Words and Phrases, Abstraction, program analysis, size-change graph, size-change termination, termination
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2757; http://www2.mta.ac.il/~amirben/downloadable/delta_sct.pdf
-
12
Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives
Schlagwörter: Categories and Subject Descriptors G.4 [Mathematical Software, Algorithm Design and Analysis, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures General Terms Algorithms, Performance Keywords matrix signature, symmetric matrix, lie group
Dateibeschreibung: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.82.559; http://www.math.umd.edu/~jda/preprints/issac05_asw.ps
-
13
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, C.2.4 [Computer-Communication Networks, Distributed Systems, 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, Bounded rates, global skew, gradient property, local skew, variable clock drifts, worst-case analysis ACM Reference Format
Dateibeschreibung: application/pdf
-
14
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms, 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, Approximation algorithm, Feedback arc set, Kemeny rank aggregation, Max acyclic subgraph, Polynomial-time approximation scheme, Tournament graphs
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.8215; http://cs.brown.edu/people/ws/papers/fast_journal.pdf
-
15
Autoren:
Weitere Verfasser:
Schlagwörter: 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 Keywords, link analysis, HITS, convergence, rank
Dateibeschreibung: application/pdf
-
16
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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 Keywords, PageRank, local computation, graph ranking 1. LOCAL PAGERANK
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.105; http://www2013.org/companion/p179.pdf
-
17
Autoren:
Weitere Verfasser:
Schlagwörter: C.2.1 [Computer-Communication Networks, Network Architecture and Design – Wireless communication, F.2.2 [Analysis Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Computations on discrete structures. General Terms, Algorithms, Performance, Design. Keywords, Wireless Sensor Networks, Multicast, Approximation Algorithm
Dateibeschreibung: application/pdf
-
18
Autoren:
Weitere Verfasser:
Schlagwörter: Nonnumerical Algorithms and Problems–Computations on discrete structures, Geometrical problems and computations General Terms Algorithms, Theory Keywords bottleneck path, maximum capacity path, matrix multiplication, sub-cubic time
Dateibeschreibung: application/pdf
-
19
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, E.1 [Data Structures, Graphs and Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Dynamic graph algorithms, topological sort
Dateibeschreibung: application/pdf
-
20
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation
Dateibeschreibung: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.475; http://www.cs.technion.ac.il/~reuven/PS/survey.ps
Nájsť tento článok vo Web of Science 
Full Text Finder