Search Results - Combinatorics—combinatorial algorithms~

On the Expressive Power of Homomorphism Counts by 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…”
Get full text

Constraint Satisfaction Problems over Finite Structures by 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…”
Get full text

Maximum Entropy Summary Trees by Karloff, Howard, Shirley, Kenneth E.

“…‐programming algorithm to compute this maximum entropy summary tree…”
Get full text

AMUSE: a minimally-unsatisfiable subformula extractor by 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…”
Get full text

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

“… However, the performance of triangle counting algorithms is usually bench-marked on undirected graphs…”
Get full text

Efficient path conditions in dependence graphs by 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…”
Get full text

Effective bounding techniques for solving unate and binate covering problems by 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…”
Get full text

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

“… We show the properties of 0-Sup-BDDs, their manipulation algorithms, and good applications for LSI CAD systems…”
Get full text

Efficient Preimage Computation Using A Novel Success-Driven ATPG by 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…”
Get full text

Possibility Degree Method for Ranking Intuitionistic Fuzzy Numbers by 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…”
Get full text

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

“…We propose new approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids…”
Get full text

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

“… To address both issues, we developed a new algorithm, Seeded Genetic Algorithm (SGA) for finding high quality solutions quickly…”
Get full text

Weight Multiplicities and Young Tableaux Through Affine Crystals by Kim, Jang Soo, Lee, Kyu-Hwan, Oh, Se-jin

“…The weight multiplicities of finite dimensional simple Lie algebras can be computed individually using various methods. Still, it is hard to derive explicit…”
Get full text

Combinatorial Framework for Similarity Search by 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…”
Get full text

Adjustable Width Linear Combinational Scan Vector Decompression by Krishna, C. V., Touba, Nur A.

“…A new scheme for combinational linear expansion isproposed for decompression of scan vectors. It has thecapability to adjust the width of the linear expansion…”
Get full text

Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions by Hudson, Benoit, Sandholm, Tuomas

“…Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and…”
Get full text

Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction by Suyama, Takayuki, Yokoo, Makoto

“…In this paper, we investigate a model of a combinatorial, procurement multi-attribute auction, in which each sales item is defined by several attributes called…”
Get full text

Energy-efficient routing for signal detection under the Neyman-Pearson criterion in wireless sensor networks by Yang, Yang, Blum, Rick S.

“…Energy-efficient routing for wireless sensor networks (WSNs) has been a topic of great interest for the last few years, but thus far routing for signal…”
Get full text

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

“…As the use of automated negotiations becomes more mainstream, one key attribute that needs to be incorporated is a measure of a seller's trust or reliability…”
Get full text

Optimal Solution Stability in Dynamic, Distributed Constraint Optimization by Petcu, Adrian, Faltings, Boi

“… Change costs are modeled with stability constraints, and can evolve over time. We present RSDPOP, a self-stabilizing optimization algorithm which guarantees optimal solution stability in dynamic environments, based on this definition…”
Get full text