Sciweavers

653 search results - page 41 / 131
» The size of minimum 3-trees
Sort
View
DCOSS
2005
Springer
15 years 5 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
15 years 27 days ago
Objective reduction using a feature selection technique
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
Antonio López Jaimes, Carlos A. Coello Coel...
ALT
1998
Springer
15 years 4 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
COCOON
2008
Springer
15 years 1 months ago
Spreading Messages
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
Ching-Lueh Chang, Yuh-Dauh Lyuu
CORR
2010
Springer
91views Education» more  CORR 2010»
14 years 12 months ago
List Decodability at Small Radii
A (n,d,e), the smallest for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size up to radius e, is determined for all d 2e...
Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Ji...