1068 search results - page 168 / 214 » Extremely randomized trees |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
ACSAC
2009
IEEE
14 years 4 months ago
2009
IEEE
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
BIOADIT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...