Sciweavers

4908 search results - page 688 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
15 years 7 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
15 years 7 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
BMCBI
2008
109views more  BMCBI 2008»
15 years 6 months ago
ConStruct: Improved construction of RNA consensus structures
Background: Aligning homologous non-coding RNAs (ncRNAs) correctly in terms of sequence and structure is an unresolved problem, due to both mathematical complexity and imperfect s...
Andreas Wilm, Kornelia Linnenbrink, Gerhard Steger
BMCBI
2008
152views more  BMCBI 2008»
15 years 6 months ago
Predicting biological system objectives de novo from internal state measurements
Background: Optimization theory has been applied to complex biological systems to interrogate network properties and develop and refine metabolic engineering strategies. For examp...
Erwin P. Gianchandani, Matthew A. Oberhardt, Antho...