2126 search results - page 122 / 426 » An optimization algorithm for imprecise multi-objective prob... |
161
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
129
click to vote
ICPR
2008
IEEE
16 years 5 months 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...
168
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
185
click to vote
ICML
1995
IEEE
16 years 5 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
110
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...