Výsledky vyhľadávania - Mathematics of computing Discrete mathematics Combinatorial Combinatorial algorithms

On the Expressive Power of Homomorphism Counts Autor Atserias, Albert, Kolaitis, Phokion G., Wu, Wei-Lin

“…A classical result by Lovász asserts that two graphs G and H are isomorphic if and only if they have the same left profile, that is, for every graph F, the…”
Získať plný text

Constraint Satisfaction Problems over Finite Structures Autor Barto, Libor, DeMeo, William, Mottet, Antoine

“…We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both…”
Získať plný text

Linear Algebra Approach for Directed Triad Counting and Enumeration Autor Kerdcharoen, Yuttapichai, Sridhar, Upasana, Sangpetch, Orathai, Low, Tze Meng

“… However, the performance of triangle counting algorithms is usually bench-marked on undirected graphs…”
Získať plný text

Zero-suppressed BDDs for set manipulation in combinatorial problems Autor Minato, Shin-ichi

“… This data structure brings unique and compact representation of sets which appear in many combinatorial problems…”
Získať plný text

AMUSE: a minimally-unsatisfiable subformula extractor Autor Oh, Yoonna, Mneimneh, Maher N., Andraus, Zaher S., Sakallah, Karem A., Markov, Igor L.

“…This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula…”
Získať plný text

Efficient path conditions in dependence graphs Autor Robschink, Torsten, Snelting, Gregor

“…Program slicing combined with constraint solving is a powerful tool for software analysis. Path conditions are generated for a slice or chop, which --- when…”
Získať plný text

An algorithm computing combinatorial specifications of permutation classes Autor Bassino, Frédérique, Bouvel, Mathilde, Pierrot, Adeline, Pivoteau, Carine, Rossin, Dominique

“…This article presents a methodology that automatically derives a combinatorial specification for a permutation class  C, given its basis…”
Získať plný text

On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram An Autor Felisiak, Mariusz, Simson, Daniel

“…We present combinatorial algorithms computing reduced mesh root systems and mesh geometries of roots for the Dynkin diagram Δ…”
Získať plný text

Effective bounding techniques for solving unate and binate covering problems Autor Li, Xiao Yu, Stallmann, Matthias F., Brglez, Franc

“…Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically…”
Získať plný text

The Logic of Graph Neural Networks Autor Grohe, Martin

“… It has recently been shown that the expressiveness of GNNs can be characterised precisely by the combinatorial Weisfeiler-Leman algorithms and by finite variable counting logics…”
Získať plný text

Possibility Degree Method for Ranking Intuitionistic Fuzzy Numbers Autor Cui-Ping Wei, Xijin Tang

“…In this paper, we study the method of ranking intuitionistic fuzzy numbers. Firstly a possibility degree formula is defined to compare two intuitionistic fuzzy…”
Získať plný text

Submodular functions: from discrete to continuous domains Autor Bach, Francis

“…Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time…”
Získať plný text

The Bounded and Precise Word Problems for Presentations of Groups Autor Ivanov, S. V.

“…We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for…”
Získať plný text

Efficient Preimage Computation Using A Novel Success-Driven ATPG Autor Sheng, Shuo, Hsiao, Michael

“… Unlike methods that combine ATPG/SAT and OBDD, we present a novel success-driven learning algorithm which significantly accelerates a ATPG engine for enumerating all solutions (preimages…”
Získať plný text

An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions Autor Avasarala, Viswanath, Polavarapu, Himanshu, Mullen, Tracy

“…Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems…”
Získať plný text

Combinatorial Framework for Similarity Search Autor Lifshits, Yury

“…We present an overview of combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are allowed…”
Získať plný text

Statistical ranking and combinatorial Hodge theory Autor Jiang, Xiaoye, Lim, Lek-Heng, Yao, Yuan, Ye, Yinyu

“… is an analogue of the Laplace operator or scalar Laplacian. We shall study the graph Helmholtzian using combinatorial Hodge theory, which provides…”
Získať plný text

Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids Autor Fukuta, Naoki, Ito, Takayuki

“…We propose new approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids…”
Získať plný text

Incorporating Trust into Combinatorial Auctions: What Does Trust Cost? Autor Airy, Guruprasad, Chen, Po-Chun, Mullen, Tracy, Yen, John

“… In this paper, we describe a combinatorial auction mechanism that allows buyers to specify their preferences over both an item and the seller's trustworthiness, and use it to generate a bid for a bundle of items…”
Získať plný text

Periodical Resource Allocation Using Approximated Combinatorial Auctions Autor Fukuta, Naoki, Ito, Takayuki

“…Combinatorial auction, one of most popular market mechanisms, is well-known mechanism for effective resource allocation to self-interested agents…”
Získať plný text