485 search results - page 21 / 97 » Iterative Bounding LAO |
PG
2003
IEEE
15 years 3 months ago
2003
IEEE
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
101
click to vote
ANOR
2008
14 years 10 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
JCT
2007
14 years 10 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
CGF
2004
14 years 10 months ago
2004
In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system...
67
Voted
HPCS
2006
IEEE
15 years 4 months ago
2006
IEEE
We analyze the behavior of Euler-Maclaurin-based integration schemes with the intention of deriving accurate and economic estimations of the error. These schemes typically provide...