Sciweavers

493 search results - page 62 / 99
» Representing preferences using intervals
Sort
View
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
14 years 9 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
ICASSP
2009
IEEE
14 years 2 months ago
Multi-flow attack resistant watermarks for network flows
In this work we present a Multi-flow Attack Resistant Interval Centroid Based Watermarking (MAR-ICBW) scheme for network flows. Our proposed scheme can withstand the newly intro...
Amir Houmansadr, Negar Kiyavash, Nikita Borisov
IPPS
2007
IEEE
14 years 2 months ago
Fast Failure Detection in a Process Group
Failure detectors represent a very important building block in distributed applications. The speed and the accuracy of the failure detectors is critical to the performance of the ...
Xinjie Li, Monica Brockmeyer
ICTAI
2006
IEEE
14 years 1 months ago
A Junction Tree Propagation Algorithm for Bayesian Networks with Second-Order Uncertainties
Bayesian networks (BNs) have been widely used as a model for knowledge representation and probabilistic inferences. However, the single probability representation of conditional d...
Maurizio Borsotto, Weihong Zhang, Emir Kapanci, Av...