Sciweavers

1095 search results - page 61 / 219
» Preprocessing of Intractable Problems
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 3 months ago
First-Order Query Rewriting for Inconsistent Databases
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
Ariel Fuxman, Renée J. Miller
CSCLP
2005
Springer
14 years 3 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
INFOCOM
2003
IEEE
14 years 3 months ago
Topology Inference in the Presence of Anonymous Routers
— Many topology discovery systems rely on traceroute to discover path information in public networks. However, for some routers, traceroute detects their existence but not their ...
Bin Yao, Ramesh Viswanathan, Fangzhe Chang, Dan G....
KR
2010
Springer
14 years 2 months ago
Towards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
Wolfgang Dvorák, Reinhard Pichler, Stefan W...
MFCS
2001
Springer
14 years 2 months ago
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
Erik D. Demaine