1529 search results - page 252 / 306 » A slant removal algorithm |
APIN
2002
13 years 8 months ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
JCO
1998
13 years 8 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
RSA
2002
13 years 8 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
TOG
2002
13 years 8 months ago
2002
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can ...
PAMI
2007
13 years 8 months ago
2007
—This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a ...