Sciweavers

9949 search results - page 345 / 1990
» On the Network Complexity of Selection
Sort
View
TSMC
2010
15 years 1 months ago
Efficient Sensor Selection for Active Information Fusion
In our previous paper [1], we formalized an active information fusion framework based on dynamic Bayesian networks to provide active information fusion. This paper focuses on a ce...
Yongmian Zhang, Qiang Ji
ADHOC
2010
123views more  ADHOC 2010»
15 years 7 months ago
An analysis of the lifetime of OLSR networks
The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the ne...
Jan-Maarten Verbree, Maurits de Graaf, Johann Huri...
TEC
2008
135views more  TEC 2008»
15 years 6 months ago
Quantum Genetic Optimization
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
Andrea Malossini, Enrico Blanzieri, T. Calarco
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
16 years 8 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
AIME
2007
Springer
16 years 1 months ago
On the Behaviour of Information Measures for Test Selection
In diagnostic decision-support systems, a test-selection facility serves to select tests that are expected to yield the largest decrease in the uncertainty about a patient’s diag...
Danielle Sent, Linda C. van der Gaag