Suchergebnisse - "Combinatorics— combinatorial algorithms"

On the Expressive Power of Homomorphism Counts von 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 …”
Volltext

Constraint Satisfaction Problems over Finite Structures von 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 …”
Volltext

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

“… Given a very large, node‐weighted, rooted tree on, say, n nodes, if one has only enough space to display a k‐node summary of the tree, what is the most …”
Volltext

AMUSE: a minimally-unsatisfiable subformula extractor von 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. Such unsatisfiable "cores" can be very …”
Volltext

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

“… Triangle counting and enumeration are commonly used in real-world applications on directed graphs. However, the performance of triangle counting algorithms is …”
Volltext

Efficient path conditions in dependence graphs von 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 …”
Volltext

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

“… In this paper, we propose Zero-Suppressed BDDs (0-Sup-BDDs), which are BDDs based on a new reduction rule. This data structure brings unique and compact …”
Volltext

Effective bounding techniques for solving unate and binate covering problems von 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 …”
Volltext

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

“… Preimage computation is a key step in formal verification. Pure OBDD-based symbolic method is vulnerable to the space-explosion problem. On the other hand, …”
Volltext

Possibility Degree Method for Ranking Intuitionistic Fuzzy Numbers von 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 …”
Volltext

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

“… We propose new approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids. In this paper, we focus on a more …”
Volltext

An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions von 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. However, …”
Volltext

Combinatorial Framework for Similarity Search von Lifshits, Yury

“… We present an overview of combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise …”
Volltext

Adjustable Width Linear Combinational Scan Vector Decompression von 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 …”
Volltext

Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions von 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 …”
Volltext

Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction von 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 …”
Volltext

Energy-efficient routing for signal detection under the Neyman-Pearson criterion in wireless sensor networks von 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 …”
Volltext

Incorporating Trust into Combinatorial Auctions: What Does Trust Cost? von 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 …”
Volltext

Combining Bundle Search with Buyer Coalition Formation in Electronic Markets: A Distributed Approach through Negotiation von He, Linli, Ioerger, Thomas R.

Volltext

A Combinatorial Auction Protocol among Versatile Experts and Amateurs von Ito, Takayuki, Yokoo, Makoto, Matsubara, Shigeo

“… Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of …”
Volltext