16843 search results - page 475 / 3369 » On Generalized Authorization Problems |
180
Voted
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
182
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
207
click to vote
SIAMJO
2002
15 years 6 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
211
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
240
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...