Suchergebnisse - nonnumerical algorithms AND problems—complexity of proof (proce OR prace)- dures general terms

PSPACE bounds for rank 1 modal logics

Autoren: Dirk Pattinson The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Dirk Pattinson The Pennsylvania State University CiteSeerX Archives

Quelle: http://users.cecs.anu.edu.au/%7Edpattinson/Publications/tocl2009.pdf.

Schlagwörter: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Modal Logic, Computational Logic, F.2.2. [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of Proof Proce- dures General Terms, Algorithms, Languages, Theory Additional Key Words and Phrases, Shallow models, resolution, coalgebra

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.685.8626; http://users.cecs.anu.edu.au/%7Edpattinson/Publications/tocl2009.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.685.8626
http://users.cecs.anu.edu.au/%7Edpattinson/Publications/tocl2009.pdf

Resiliency Policies in Access Control

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: https://www.cs.purdue.edu/homes/ninghui/papers/resiliency_tissec.pdf.

Schlagwörter: Categories and Subject Descriptors, D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof proce- dures General Terms, Security, Theory Additional Key Words and Phrases, Access Control, Fault-tolerant, Policy Design

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.675.3719

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.675.3719

On Mutually-Exclusive Roles and Separation of

Autoren: Ninghui Li Mahesh V. Tripunitara Ziad Bizri et al.

Weitere Verfasser: Ninghui Li Mahesh V. Tripunitara Ziad Bizri et al.

Quelle: https://www.cs.purdue.edu/homes/ninghui/papers/sod-j.pdf.

Schlagwörter: Categories and Subject Descriptors, D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof proce- dures General Terms, Security, Theory Additional Key Words and Phrases, role-based access control, separation of duty, constraints, verification, com- putational

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.681.7590

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.681.7590

An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints.

Autoren: Jansen, Klaus Zhang, Hu

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p416-434, 19p

Schlagwörter: ALGORITHMS, COMPUTATIONAL mathematics, ALGEBRA, COMPUTER programming, MATHEMATICAL analysis, INFORMATION technology

ABSTRACTS from other ACM Publications.

Quelle: Communications of the ACM; Apr1982, Vol. 25 Issue 4, p286-291, 6p

Schlagwörter: AUTOMATIC theorem proving, SPANNING trees, TREE graphs, PROOF theory

An Approximation Scheme for Stochastic Linear Programming and Its Application to Stochastic Integer Programs.

Autoren: Shmoys, David B. Swamy, Chaitanya

Quelle: Journal of the ACM; Nov2006, Vol. 53 Issue 6, p978-1012, 35p

Schlagwörter: STOCHASTIC analysis, MATHEMATICAL optimization, PROBABILITY theory, LINEAR statistical models, POLYNOMIALS, ALGORITHMS

PSPACE Bounds for Rank-1 Modal Logics.

Autoren: Schröder, Lutz Pattinson, Dirk

Quelle: ACM Transactions on Computational Logic; Feb2009, Vol. 10 Issue 2, p13-13.33, 33p, 2 Diagrams

Schlagwörter: ALGORITHMS, TECHNOLOGICAL complexity, COMPUTATIONAL complexity, PROGRAMMING languages, MATHEMATICAL logic

Truthful Mechanisms with Implicit Payment Computation.

Autoren: Babaioff, Moshe Kleinbergy, Robert D. Slivkins, Aleksandrs

Quelle: EC: Electronic Commerce; 2010, p43-52, 10p

Schlagwörter: AUCTIONS, BIDDING strategies, BIDDERS, PAYMENT, ALGORITHMS, MANAGEMENT

Compressing and Indexing Labeled Trees, with Applications.

Autoren: FERRAGINA, PAOLO LUCCIO, FABRIZIO MANZINI, GIOVANNI et al.

Quelle: Journal of the ACM; Nov2009, Vol. 57 Issue 1, p4-4:33, 33p, 2 Diagrams, 18 Charts

Schlagwörter: XML (Extensible Markup Language), ERGODIC theory, DOCUMENT markup languages, WEB development, DOCUMENT type definitions, WEBSITES, COMPUTER science research

PROGRAM VERIFICATION: THE VERY IDEA.

Autoren: Fetzer, James H.

Quelle: Communications of the ACM; Sep88, Vol. 31 Issue 9, p1048-1063, 16p, 2 Diagrams, 3 Charts

Schlagwörter: SOFTWARE verification, RELIABILITY in engineering

ABSTRACTS from other ACM Publications.

Quelle: Communications of the ACM; Mar1982, Vol. 25 Issue 3, p213-215, 3p

Schlagwörter: COMPUTER science, DATA flow computing, FORTRAN, COMPUTER software

Firma/Körperschaft: ASSOCIATION for Computing Machinery

Efficient Algorithms for Bichromatic Separability.

Autoren: AGARWAL, PANKAJ K. ARONOV, BORIS KOLTUN, VLADLEN

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 2, p209-227, 19p

Schlagwörter: GEOMETRY, ALGORITHMS, PRISMS, BEAM splitters, MAGNITUDE estimation, STATISTICS

Optimal Branch-Decomposition of Planar Graphs in O(n³) Time.

Autoren: QIAN-PING GU HISAO TAMAKI

Quelle: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p30-30:13, 13p, 2 Diagrams, 2 Charts

Schlagwörter: ALGORITHMS, MATHEMATICAL analysis, NUMERICAL analysis, COMPUTATIONAL mathematics, GRAPH theory, POLYNOMIALS

A New Perspective on Implementation by Voting Trees.

Autoren: Fischer, Felix Procaccia, Ariel D. Samorodnitsky, Alex

Quelle: EC: Electronic Commerce; 2009, p31-40, 10p, 2 Diagrams

Schlagwörter: APPROXIMATION theory, DECISION making, MARKOV processes, DIFFUSION processes, STOCHASTIC processes, PROBLEM solving, CHEBYSHEV systems

Approximate Shared-Memory Counting Despite a Strong Adversary.

Autoren: Aspnes, James Censor, Keren

Quelle: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p25:1-25:23, 23p

Schlagwörter: APPROXIMATION theory, MATHEMATICAL models, OPERATOR algebras, MATHEMATICAL statistics, PROBABILITY measures, MATHEMATICAL variables

Extraction and Classification of Dense Implicit Communities in the Web Graph.

Autoren: DOURISBOURE, YON GERACI, FILIPPO PELLEGRINI, MARCO

Quelle: ACM Transactions on the Web; Apr2009, Vol. 3 Issue 2, p7-7-36, 36p, 9 Diagrams, 9 Charts, 1 Graph

Schlagwörter: WORLD Wide Web, INFORMATION sharing, COMPUTER science literature, HYPERLINKS, KEYWORDS

New Technologies, Development and Application VIII

Autoren: Isak Karabegović Ahmed Kovačević Sadko Mandžuka

Resource Type: eBook.

Schlagworte: Technological innovations--Congresses, Industry 4.0--Congresses, Automation--Congresses

Categories: COMPUTERS / Artificial Intelligence / General

ECAI 2023 : 26th European Conference on Artificial Intelligence, September 30 – October 4, 2023, Kraków, Poland – Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)

Autoren: Kobi Gal Ann Nowé Grzegorz J. Nalepa et al.

Resource Type: eBook.

Categories: COMPUTERS / Artificial Intelligence / General

Computing Handbook : Two-Volume Set

Autoren: Allen Tucker Teofilo Gonzalez Heikki Topi et al.

Resource Type: eBook.

Schlagworte: QA76

Categories: COMPUTERS / General, COMPUTERS / Programming / Games, COMPUTERS / Information Technology, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Computer Engineering, MATHEMATICS / General, MATHEMATICS / Arithmetic

Probabilistic and Causal Inference : The Works of Judea Pearl

Autoren: Hector Geffner Rina Dechter Joseph Halpern

Resource Type: eBook.

Schlagworte: Causation, Artificial intelligence, Probabilities

Categories: COMPUTERS / Data Science / Machine Learning, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Artificial Intelligence / Expert Systems