143 search results - page 13 / 29 » An Algorithm for Construction of Test Cases for the Quadrati... |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
NIPS
2007
13 years 9 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
— Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression tec...