1 document found, page 1 of 1
Sort by
Issue Date
On the Hyperbox – Hyperplane Intersection Problem
Lara, Carlos; Flores, Juan J.; Calderon, FelixFinding the intersection between a hyperbox and a hyperplane can be computationally expensive specially for high dimensional problems. Naive algorithms have an exponential complexity. A border node is a node (in the graph induced by the hyperbox) at or next to the intersection of the hyperbox and the hyperplane. The algorithm proposed in this paper implements a systematic way to efficiently generate border node...
Date: 2009
|
Origin: Oasisbr