Sciweavers

64 search results - page 3 / 13
» Tractable Classes for Directional Resolution
Sort
View
AAAI
2008
15 years 12 days ago
Credulous Resolution for Answer Set Programming
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
Piero A. Bonatti, Enrico Pontelli, Tran Cao Son
IWPEC
2009
Springer
15 years 4 months ago
On the Directed Degree-Preserving Spanning Tree Problem
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
ENGL
2008
192views more  ENGL 2008»
14 years 10 months ago
Sensitivity Analysis for Direction of Arrival Estimation using a Root-MUSIC Algorithm
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
Zekeriya Aliyazicioglu, H. K. Hwang, Marshall Gric...
FOCS
2002
IEEE
15 years 3 months ago
A Dichotomy Theorem for Constraints on a Three-Element Set
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
Andrei A. Bulatov
IPL
2007
121views more  IPL 2007»
14 years 10 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar