3168 search results - page 298 / 634 » Neutrosophic Relational Data Model |
179
Voted
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
199
click to vote
IJAR
2010
15 years 5 months ago
2010
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
178
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
210
click to vote
AUTOMATICA
2010
15 years 5 months ago
2010
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
169
click to vote
SIGCOMM
1994
ACM
15 years 10 months ago
1994
ACM
Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially...