1772 search results - page 233 / 355 » Classifying Problems into Complexity Classes |
116
click to vote
SIAMCOMP
2002
15 years 2 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
139
click to vote
ALT
1997
Springer
15 years 6 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
172
click to vote
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
142
click to vote
PR
2008
15 years 2 months ago
2008
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...