1449 search results - page 93 / 290 » Self-Randomized Exponentiation Algorithms |
134
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
159
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
164
click to vote
RSCTC
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
162
click to vote
AAAI
2004
15 years 7 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
175
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...