Suchergebnisse - Mathematics of computing Discrete mathematics 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

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

“… However, the performance of triangle counting algorithms is usually bench-marked on undirected graphs …”
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 …”
Volltext

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

“… points.In this contribution we show how to make path conditions work for large programs. Aggressive engineering, based on interval analysis and BDDs, is shown to overcome the potential combinatoric explosion …”
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

“… 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 …”
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

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 …”
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 …”
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 similarity values are allowed …”
Volltext

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

A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation von Law, Terence H. -W., Pearce, Adrian R.

“… distribution through graph decomposition and multi-stage solution quality propagation. Experimental result shows that our new algorithm is faster than a recent competitive distributed algorithm for solving MaxSAT graph colouring problems …”
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 quality, the buyer is the auctioneer (e.g., a government …”
Volltext

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

“… In particular, the first one leads to a combinatorial problem of identifying a path …”
Volltext

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

“… Combinatorial auction, one of most popular market mechanisms, is well-known mechanism for effective resource allocation to self-interested agents …”
Volltext

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

“… We define the distributed, continuous-time combinatorial optimization problem. We propose a new notion of solution stability in dynamic optimization, based on the cost of change from an already-implemented solution to the new one …”
Volltext

Solving Combinatorial Exchanges: Optimality via a Few Partial Bids von Kothari, Anshul, Sandholm, Tuomas, Suri, Subhash

Volltext