699 search results - page 54 / 140 » The method of combinatorial telescoping |
93
Voted
NIPS
2007
15 years 2 months ago
2007
Statistical models on full and partial rankings of n items are often of limited practical use for large n due to computational consideration. We explore the use of non-parametric ...
113
Voted
NIPS
1994
15 years 1 months ago
1994
Many real world learning problems are best characterized by an interaction of multiple independent causes or factors. Discovering such causal structure from the data is the focus ...
100
click to vote
CORR
2008
Springer
15 years 19 days ago
2008
Springer
The Penrose-Banzhaf index and the Shapley-Shubik index are the best-known and the most used tools to measure political power of voters in simple voting games. Most methods to calc...
110
click to vote
EOR
2008
15 years 19 days ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
104
click to vote
TSMC
2002
15 years 6 days ago
2002
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...