Výsledky vyhľadávania - Mathematics of computing Discrete mathematics Combinatorics 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

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

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

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

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

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

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

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

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

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

“…Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc…”
Získať plný text

Adjustable Width Linear Combinational Scan Vector Decompression Autor 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…”
Získať plný text

A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation Autor 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…”
Získať plný text

Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction Autor 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…”
Získať plný text

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

“… In particular, the first one leads to a combinatorial problem of identifying a path…”
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

Optimal Solution Stability in Dynamic, Distributed Constraint Optimization Autor 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…”
Získať plný text

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

Získať plný text