19 search results - page 3 / 4 » Optimal algorithms for global optimization in case of unknow... |
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
FCS
2008
13 years 7 months ago
2008
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. There are conflicting reports over whether multiple independent runs of genetic algorithms (GAs) with small populations can reach solutions of higher quality or can fin...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision ...