Sciweavers

98 search results - page 3 / 20
» Nonlinear function approximation: Computing smooth solutions...
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
13 years 11 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
ANOR
2010
130views more  ANOR 2010»
13 years 3 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
IMR
2004
Springer
13 years 11 months ago
Smoothing and Adaptive Redistribution for Grids with Irregular Valence and Hanging Nodes
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
Larisa Branets, Graham F. Carey
STACS
2005
Springer
13 years 11 months ago
Cycle Cover with Short Cycles
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
PG
2002
IEEE
13 years 11 months ago
Approximation with Active B-Spline Curves and Surfaces
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization al...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...