1920 search results - page 155 / 384 » The Complexity of the A B C Problem |
165
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
182
click to vote
EPIA
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
130
click to vote
NAACL
2007
15 years 8 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
167
click to vote
WSC
2001
15 years 8 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
148
click to vote
FLAIRS
1998
15 years 8 months ago
1998
The increasing number of knowledge-based systems that build on a Bayesian belief network or influence diagram acknowledge the usefulness of these frameworks for addressing complex...