2190 search results - page 32 / 438 » Incomplete Information Processing for Optimization of Distri... |
110
Voted
SIGMETRICS
1998
ACM
14 years 10 months ago
1998
ACM
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
86
Voted
CRYPTO
1999
Springer
15 years 3 months ago
1999
Springer
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
78
Voted
IJON
2007
14 years 10 months ago
2007
This perspective paper explores principles of unsupervised learning and how they relate to face recognition. Dependency coding and information maximization appear to be central pr...
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
107
click to vote
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
— We consider problems where multiple agents must cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange...