3991 search results - page 557 / 799 » Bounding homogeneous models |
149
Voted
CGF
2005
15 years 4 months ago
2005
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...
141
click to vote
JNW
2007
15 years 4 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
130
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
147
click to vote
EOR
2002
15 years 4 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
140
click to vote
EOR
2002
15 years 4 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...