Sciweavers

443 search results - page 66 / 89
» Partial Probability: Theory and Applications
Sort
View
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 5 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
IRI
2005
IEEE
15 years 4 months ago
Handling missing values via decomposition of the conditioned set
In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly impr...
Mei-Ling Shyu, Indika Kuruppu-Appuhamilage, Shu-Ch...
ICML
2004
IEEE
15 years 4 months ago
Online learning of conditionally I.I.D. data
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
Daniil Ryabko
AIIA
2003
Springer
15 years 4 months ago
Improving the SLA Algorithm Using Association Rules
A bayesian network is an appropriate tool for working with uncertainty and probability, that are typical of real-life applications. In literature we find different approaches for b...
Evelina Lamma, Fabrizio Riguzzi, Andrea Stambazzi,...
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
15 years 3 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis