518 search results - page 15 / 104 » Beating a Random Assignment |
106
click to vote
ICML
2010
IEEE
15 years 24 days ago
2010
IEEE
Generative topic models such as LDA are limited by their inability to utilize nontrivial input features to enhance their performance, and many topic models assume that topic assig...
113
click to vote
CIG
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper, coevolution is used to evolve Artificial Neural Networks (ANN) which evaluate board positions of a two player zero-sum game (The Virus Game). The coevolved neura...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form o...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
102
click to vote
FCT
2009
Springer
15 years 6 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di...