5214 search results - page 370 / 1043 » The Online Specialization Problem |
153
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
178
click to vote
MP
2006
15 years 6 months ago
2006
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
154
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
187
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
169
click to vote
JAL
2007
15 years 6 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...