Sciweavers

1057 search results - page 151 / 212
» Theoretical and Experimental DNA Computation
Sort
View
IWVF
2001
Springer
15 years 2 months ago
Minimum-Length Polygons in Approximation Sausages
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, ...
COMPGEOM
1999
ACM
15 years 2 months ago
Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
Steven A. Wilmarth, Nancy M. Amato, Peter F. Still...
EUROPAR
2004
Springer
15 years 1 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
FM
2006
Springer
146views Formal Methods» more  FM 2006»
15 years 1 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic algorithms for positioning and utilizing sensors in synthetically generated landscapes
Positioning multiple sensors for acquisition of a a given environment is one of the fundamental research areas in various fields, such as military scouting, computer vision and ro...
Haluk Topcuoglu, Murat Ermis