Results 1  10
of
165,698
Tractability results for automatic contracting
 In Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI2004
, 2004
"... Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strategies for use by software agents. However, comparatively little effort has been devoted to understanding the computationa ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
redistribution of tasks amongst themselves, where the tasks involve visiting nodes in a graph. Focussing on a particular representation of the domain (as a spanning tree), we establish a number of complexity results pertaining to the complexity of negotiation in this scenario, with our main result to the effect
Equivalence and Tractability Results for SAS+ Planning
 Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR92
, 1992
"... We define the SAS + planning formalism, which generalizes the previously presented SAS formalism. The SAS + formalism is compared with some betterknown propositionalplanning formalisms with respect to expressiveness. Contrary to intuition, all formalisms turn out to be equally expressive in a v ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
very strong sense. We further present the SAS + PUS planning problem which generalizes the previously presented, tractable SASPUS problem. We prove that also the SAS +  PUS problem is tractable by devising a provably correct polynomial time algorithm for this problem. 1 Introduction Much effort
A Tractability Result for the Clenshaw Curtis Smolyak Algorithm
, 2013
"... The consecutive numbering of the publications is determined by their chronological order. The aim of this preprint series is to make new research rapidly available for scientific discussion. Therefore, the responsibility for the contents is solely due to the authors. The publications will be distrib ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
The consecutive numbering of the publications is determined by their chronological order. The aim of this preprint series is to make new research rapidly available for scientific discussion. Therefore, the responsibility for the contents is solely due to the authors. The publications will be distributed by the authors.
Structural Properties and Tractability Results for Linear Synteny
 11th Annual Symposium on Combinatorial Pattern Matching
, 2000
"... he syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
he syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally dicult to compute and have resisted efficient approximation algorithms with nontrivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a nontrivial class of instances. It is based on a novel connection between the syntenic distance an...
Tractability Results for the ConsecutiveOnes Property with Multiplicity
, 2011
"... A binary matrix has the ConsecutiveOnes Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1P where columns can appear multiple times in the ordering. Although the general problem of deciding the C1P with multipli ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
with multiplicity is NPcomplete, we present here a case of interest in comparative genomics that is tractable.
Tractability results for weighted Banach spaces of smooth functions
, 2011
"... We study the L∞approximation problem for weighted Banach spaces of smooth dvariate functions, where d can be arbitrarily large. We consider the worst case error for algorithms that use finitely many pieces of information from different classes. Adaptive algorithms are also allowed. For a scale of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of Banach spaces we prove necessary and sufficient conditions for tractability in the case of product weights. Furthermore, we show the equivalence of weak tractability with the fact that the problem does not suffer from the curse of dimensionality. 1
Tractable reasoning and efficient query answering in description logics: The DLLite family
 J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DLLite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract

Cited by 495 (123 self)
 Add to MetaCart
of the ABox (i.e., in data complexity). To the best of our knowledge, this is the first result of polynomial time data complexity for query answering over DL knowledge bases. Notably our logics allow for a separation between TBox and ABox reasoning during query evaluation: the part of the process requiring
FixedParameter Tractability Results for Feedback Set Problems in Tournaments
 JOURNAL OF DISCRETE ALGORITHMS
, 2009
"... Complementing recent progress on classical complexity and polynomialtime approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixedparameter tractability results for these problems. We show that Feedback Vertex Set in tournaments (FVST) is amenable to the nove ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
Complementing recent progress on classical complexity and polynomialtime approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixedparameter tractability results for these problems. We show that Feedback Vertex Set in tournaments (FVST) is amenable
FixedParameter Tractability Results for FullDegree Spanning Tree and Its Dual
 In Proc. the 2nd International Workshop on Parameterized and Exact Computation (IWPEC), Springer LNCS
, 2006
"... We provide firsttime fixedparameter tractability results for the NPhard problems Maximum FullDegree Spanning Tree and MinimumVertex Feedback Edge Set. These problems are dual to each other: In Maximum FullDegree Spanning Tree, the task is to find a spanning tree for a given graph that maximizes ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We provide firsttime fixedparameter tractability results for the NPhard problems Maximum FullDegree Spanning Tree and MinimumVertex Feedback Edge Set. These problems are dual to each other: In Maximum FullDegree Spanning Tree, the task is to find a spanning tree for a given graph
Results 1  10
of
165,698