2412 search results - page 217 / 483 » Which Problems Have Strongly Exponential Complexity |
175
click to vote
ERSHOV
2009
Springer
15 years 7 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
115
Voted
JAIR
2008
15 years 3 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
167
click to vote
DAWAK
2001
Springer
15 years 8 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
157
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
128
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...