Sciweavers

697 search results - page 29 / 140
» Approximation of Information Granule Sets
Sort
View
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
15 years 5 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
CEC
2005
IEEE
15 years 5 months ago
Constraint quadratic approximation operator for treating equality constraints with genetic algorithms
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
Elizabeth F. Wanner, Frederico G. Guimarães...
IPSN
2009
Springer
15 years 6 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
EMSOFT
2004
Springer
15 years 5 months ago
Conservative approximations for heterogeneous design
Embedded systems are electronic devices that function in the context of a real environment, by sensing and reacting to a set of stimuli. Because of their close interaction with th...
Roberto Passerone, Jerry R. Burch, Alberto L. Sang...
IWVF
2001
Springer
15 years 4 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, ...