Sciweavers

879 search results - page 6 / 176
» Greedy Attribute Selection
Sort
View
ITIIS
2010
140views more  ITIIS 2010»
13 years 2 months ago
RGF: Receiver-based Greedy Forwarding for Energy Efficiency in Lossy Wireless Sensor Networks
Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local informa...
In Hur, Moonseong Kim, Jaewan Seo, Hyunseung Choo
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
RECOMB
2007
Springer
14 years 8 months ago
Selecting Genomes for Reconstruction of Ancestral Genomes
It is often impossible to sequence all descendent genomes to reconstruct an ancestral genome. In addition, more genomes do not necessarily give a higher accuracy for the reconstruc...
Guoliang Li, Jian Ma, Louxin Zhang
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
INFOCOM
2009
IEEE
14 years 2 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao