5263 search results - page 183 / 1053 » Optimization with Extremal Dynamics |
ICPR
2008
IEEE
16 years 17 days ago
2008
IEEE
When a large amount of data are missing, or when multiple hidden nodes exist, learning parameters in Bayesian networks (BNs) becomes extremely difficult. This paper presents a lea...
ICML
2008
IEEE
16 years 5 days ago
2008
IEEE
A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possi...
CADE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
ISLPED
2003
ACM
15 years 4 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
106
click to vote
IFIP7
2001
Springer
15 years 3 months ago
2001
Springer
Support vector machines (SVMs) have played a key role in broad classes of problems arising in various fields. Much more recently, SVMs have become the tool of choice for problems...