1554 search results - page 81 / 311 » Parameterized Complexity and Approximation Algorithms |
140
Voted
CSL
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
138
click to vote
IJCAI
1997
15 years 4 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
127
click to vote
APAL
2007
15 years 3 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
160
click to vote
MST
2010
14 years 9 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
122
Voted
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...