Sciweavers

1074 search results - page 44 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
DAC
2002
ACM
15 years 10 months ago
Model order reduction for strictly passive and causal distributed systems
This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algor...
Luca Daniel, Joel R. Phillips
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
15 years 3 months ago
Adaptive variance scaling in continuous multi-objective estimation-of-distribution algorithms
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
Peter A. N. Bosman, Dirk Thierens
SC
2009
ACM
15 years 4 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
DIS
2007
Springer
15 years 3 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
ECML
2003
Springer
15 years 2 months ago
Support Vector Machines with Example Dependent Costs
Abstract. Classical learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depe...
Ulf Brefeld, Peter Geibel, Fritz Wysotzki