1092 search results - page 18 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
101
click to vote
COLOGNETWENTE
2010
14 years 10 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
128
click to vote
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
MOR
2002
14 years 11 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...