مكتبة

Source: IEEE Transactions on Control of Network SystemsIEEE Transactions on Control of Network Systems, 2022, 9 (3), pp.1435-1446. ⟨10.1109/TCNS.2021.3114377⟩IEEE Transactions on Control of

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

Authors : Niels Grüttemeier; Christian Komusiewicz

Subjects: FOS: Computer and information sciences; Vertex (graph theory); Class (set theory)

Source: IJCAI

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Concentration on the Boolean hypercube via pathwise stochastic analysis

Authors : Renan Gross; Ronen Eldan

Subjects: FOS: Computer and information sciences; Discrete mathematics; Vertex (graph theory)

Source: STOCProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Spanners in randomly weighted graphs: Independent edge lengths

Authors : Alan Frieze; Wesley Pegden

Subjects: FOS: Computer and information sciences; Vertex (graph theory); Random graph

Source: Discrete Applied Mathematics. 309:68-74

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Single-source shortest paths and strong connectivity in dynamic planar graphs

Authors : Panagiotis Charalampopoulos; Adam Karczmarz

Subjects: Vertex (graph theory); Discrete mathematics; Strongly connected component

Source: Journal of Computer and System Sciences. 124:97-111

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Envy-free matchings in bipartite graphs and their applications to fair division

Authors : Erel Segal-Halevi; Elad Aigner-Horev

Subjects: FOS: Computer and information sciences; Vertex (graph theory); Computer Science::Computer Science and Game Theory

Source: Information Sciences. 587:164-187

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure

Authors : Luciano S. de Souza; Tiago A. E. Ferreira; Jonathan H. A. de Carvalho

Subjects: Vertex (graph theory); Quantum Physics; Artificial neural network

Source: IEEE Transactions on Computers. 71:378-389

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

On the complexity of solution extension of optimization problems

Authors : Mehdi Khosravian Ghadikolaei; Florian Sikora; Henning Fernau

Subjects: FOS: Computer and information sciences; Vertex (graph theory); Discrete mathematics

Source: Theoretical Computer Science. 904:48-65

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

نتائج البحث

فلترة النتائج

The complexity of restricted star colouring

Nonsymmetric Macdonald polynomials via integrable vertex models

Dynamic Social Learning Under Graph Constraints

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

Concentration on the Boolean hypercube via pathwise stochastic analysis

Spanners in randomly weighted graphs: Independent edge lengths

Single-source shortest paths and strong connectivity in dynamic planar graphs

Envy-free matchings in bipartite graphs and their applications to fair division

Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure

On the complexity of solution extension of optimization problems

اتصل بنا

اتبع