2412 search results - page 111 / 483 » Which Problems Have Strongly Exponential Complexity |
130
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
124
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
134
click to vote
ESEM
2009
ACM
15 years 7 months ago
2009
ACM
Test coverage is a promising measure of test effectiveness and development organizations are interested in costeffective levels of coverage that provide sufficient fault removal w...
143
Voted
CONCUR
2001
Springer
15 years 7 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
149
click to vote
TCS
2010
15 years 1 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...