145 search results - page 6 / 29 » Parameterized Complexity Classes under Logical Reductions |
137
click to vote
JAIR
2011
14 years 10 months ago
2011
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
142
Voted
SODA
2010
ACM
16 years 20 days ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
130
click to vote
VLDB
2002
ACM
15 years 2 months ago
2002
ACM
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
124
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background:Receptors and scaffold proteins possess a number of distinct domains and bind multiple partners. A common problem in modeling signaling systems arises from a combinator...
118
Voted
ACSC
2005
IEEE
15 years 9 months ago
2005
IEEE
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...