139 search results - page 22 / 28 » A Grid-enabled Branch and Bound Algorithm for Solving Challe... |
133
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
136
click to vote
DGCI
2009
Springer
15 years 6 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
151
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
116
click to vote
IVC
2007
15 years 3 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
150
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...