Sciweavers

461 search results - page 66 / 93
» Bounds for Validation
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, ...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 2 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
SAC
2000
ACM
15 years 2 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom
CC
1999
Springer
320views System Software» more  CC 1999»
15 years 2 months ago
Floating Point to Fixed Point Conversion of C Code
In processors that do not support floating-point instructions, using fixed-point arithmetic instead of floating-point emulation trades off computation accuracy for execution spe...
Andrea G. M. Cilio, Henk Corporaal
SRDS
1999
IEEE
15 years 2 months ago
Fault Injection based on a Partial View of the Global State of a Distributed System
Validating distributed systems is particularly difficult, since failures may occur due to a correlated occurrence of faults in different parts of the system. This paper describes ...
Michel Cukier, Ramesh Chandra, David Henke, Jessic...