Results 1  10
of
718
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 582 (53 self)
 Add to MetaCart
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper
PARTIAL ORDERS EMBEDDING IS NPCOMPLETE
, 2014
"... Following Barwise, we consider examples of natural language sentences that seem to express that there is an embedding of one partial order into the other. We prove NPcompleteness of two versions of partial orders embedding problem. We show that the task of computing the truth value of such sentence ..."
Abstract
 Add to MetaCart
Following Barwise, we consider examples of natural language sentences that seem to express that there is an embedding of one partial order into the other. We prove NPcompleteness of two versions of partial orders embedding problem. We show that the task of computing the truth value
On the NPcompleteness of some graph cluster measures
 In Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2006), LNCS 3831
, 2006
"... Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Proposed clustering algorithms usually optimize various fitness functions that measure the quality of a cluster within the graph. Examples of such cluster measures include the conductance, ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
, the local and relative densities, and single cluster editing. We prove that the decision problems associated with the optimization tasks of finding the clusters that are optimal with respect to these fitness measures are NPcomplete. 1
An Analysis of NPCompleteness in Novelty and Diversity Ranking
 In Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory
, 2009
"... Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a query with some distribution, or should contain a diverse set of subtopics related to the user's information need, or ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
, or contain nuggets of information with little redundancy. Evaluation measures have been introduced to measure the effectiveness of systems at this task, but these measures have worstcase NPcomplete computation time. We use simulation to investigate the implications of this for optimization and evaluation
Addressing NPcomplete puzzles with MonteCarlo methods
 IN PROCEEDINGS OF THE AISB 2008 SYMPOSIUM ON LOGIC AND THE SIMULATION OF INTERACTION AND REASONING, VOLUME 9
, 2008
"... NPcomplete problems are a challenging task for researchers, who investigate tractable versions and attempt to generalise the methods used for solving them. Over the years a large set of successful standard methods have been developed. We mention A * and IDA* which have proven to be reasonably succe ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
NPcomplete problems are a challenging task for researchers, who investigate tractable versions and attempt to generalise the methods used for solving them. Over the years a large set of successful standard methods have been developed. We mention A * and IDA* which have proven to be reasonably
NPCompleteness of The Bulk Synchronous Task Scheduling Problem and Its Approximation Algorithms
 Proc. of 2000 Int. Symposium on Parallel Architectures, Algorithms, and Networks
, 2000
"... The bulk synchronous task scheduling problem (BSSP) is known as an effective task scheduling problem for distributedmemory machines, but the time complexity of BSSP is unknown. This paper presents a proof of NPcompleteness of BSSP even in the case of unit time tasks and positive integer constant co ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The bulk synchronous task scheduling problem (BSSP) is known as an effective task scheduling problem for distributedmemory machines, but the time complexity of BSSP is unknown. This paper presents a proof of NPcompleteness of BSSP even in the case of unit time tasks and positive integer constant
Nearoptimal sensor placements in gaussian processes
 In ICML
, 2005
"... When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to address this task, for example, geometry or disk models, placing sensors at the points of highest entropy (variance) in t ..."
Abstract

Cited by 342 (34 self)
 Add to MetaCart
information is NPcomplete. To address this issue, we describe a polynomialtime approximation that is within (1 − 1/e) of the optimum by exploiting the submodularity of mutual information. We also show how submodularity can be used to obtain online bounds, and design branch and bound search procedures. We
Simple Amazons endgames and their connection
"... Abstract. Amazons is a young board game with simple rules and a high branching factor, which makes it a suitable testbed for planning research. This paper considers the computational complexity of Amazons puzzles and restricted Amazons endgames. We first prove the NPcompleteness of the Hamilton cir ..."
Abstract
 Add to MetaCart
circuit problem for cubic subgraphs of the integer grid. This result is then used to show that solving Amazons puzzles is an NPcomplete task and determining the winner of simple Amazons endgames is NPequivalent.
PerformanceEffective and LowComplexity Task Scheduling for Heterogeneous Computing
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NPcomplete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract

Cited by 255 (0 self)
 Add to MetaCart
Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NPcomplete in general cases as well as in several restricted cases. Because of its key importance, this problem has been
Generating and selecting grammatical paraphrases
 In Proceedings of the 10th European Workshop on Natural Language Generation
, 2005
"... Natural language has a high paraphrastic power yet not all paraphrases are appropriate for all contexts. In this paper, we present a TAG based surface realiser which supports both the generation and the selection of paraphrases. To deal with the combinatorial explosion typical of such an NPcomplete ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
Natural language has a high paraphrastic power yet not all paraphrases are appropriate for all contexts. In this paper, we present a TAG based surface realiser which supports both the generation and the selection of paraphrases. To deal with the combinatorial explosion typical of such an NPcomplete
Results 1  10
of
718