Sciweavers

1368 search results - page 165 / 274
» Generalized Rook Polynomials
Sort
View
130
Voted
ATAL
2009
Springer
15 years 11 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
135
Voted
TAMC
2009
Springer
15 years 11 months ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia
PIMRC
2008
IEEE
15 years 11 months ago
Multihop-enabled orthogonalization in Distributed MIMO Networks
—It has recently been proposed to orthogonalize the data streams of n interfering source-destination pairs by employing an intermediate stage of non-cooperating coherent amplify-...
Jörg Wagner, Marc Kuhn, Armin Wittneben
LPNMR
2007
Springer
15 years 11 months ago
Head-Elementary-Set-Free Logic Programs
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Martin Gebser, Joohyung Lee, Yuliya Lierler
FSTTCS
2005
Springer
15 years 10 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev