4860 search results - page 359 / 972 » SNPs Problems, Complexity, and Algorithms |
117
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
124
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
118
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
144
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
134
Voted
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...