Sciweavers

4276 search results - page 21 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
ICSOFT
2008
13 years 9 months ago
An Architecture for Non Functional Properties Management in Distributed Computing
One of the primary benefits of Service Oriented Architecture (SOA) [1] is the ability to compose applications, processes or more complex services from other services. As the comple...
Pierre de Leusse, Panos Periorellis, Theodosis Dim...
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
13 years 8 months ago
Discriminating self from non-self with finite mixtures of multivariate Bernoulli distributions
Affinity functions are the core components in negative selection to discriminate self from non-self. It has been shown that affinity functions such as the r-contiguous distance an...
Thomas Stibor
ICML
1999
IEEE
14 years 8 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
PE
2000
Springer
118views Optimization» more  PE 2000»
13 years 7 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...