Sciweavers

464 search results - page 38 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
CIT
2007
Springer
15 years 6 months ago
Performance Assessment of Some Clustering Algorithms Based on a Fuzzy Granulation-Degranulation Criterion
In this paper a fuzzy quantization dequantization criterion is used to propose an evaluation technique to determine the appropriate clustering algorithm suitable for a particular ...
Sriparna Saha, Sanghamitra Bandyopadhyay
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 6 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
108
Voted
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 2 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
DAC
2010
ACM
15 years 3 months ago
PreDVS: preemptive dynamic voltage scaling for real-time systems using approximation scheme
System optimization techniques based on dynamic voltage scaling (DVS) are widely used with the aim of reducing processor energy consumption. Inter-task DVS assigns the same voltag...
Weixun Wang, Prabhat Mishra
IPSN
2004
Springer
15 years 5 months ago
Modeling of sensor nets in Ptolemy II
This paper describes a modeling and simulation framework called VisualSense for wireless sensor networks that builds on and leverages Ptolemy II. This framework supports actor-ori...
Philip Baldwin, Sanjeev Kohli, Edward A. Lee, Xiao...