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 ...
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...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
: 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...
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can ...
—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 ...