1243 search results - page 186 / 249 » Complexity reduction of C-Algorithm |
111
click to vote
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
104
click to vote
ECML
2007
Springer
15 years 7 months ago
2007
Springer
Averaged One-Dependence Estimators (AODE) classifies by uniformly aggregating all qualified one-dependence estimators (ODEs). Its capacity to significantly improve naive Bayes...
EUROPAR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs (from now on, computational kernel...
175
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
110
click to vote
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...