1074 search results - page 5 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
101
click to vote
AI
2002
Springer
14 years 9 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
COLT
2003
Springer
15 years 2 months ago
2003
Springer
A general class of no-regret learning algorithms, called no-Φ-regret learning algorithms, is defined which spans the spectrum from no-external-regret learning to no-internal-reg...
TNN
2008
14 years 9 months ago
2008
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
TSP
2008
14 years 9 months ago
2008
One of the key issues in decentralized beamforming is the need to phasealign the carriers of all the sensors in the network. Recent work in this area has shown the viability of ce...
92
Voted
MSR
2006
ACM
15 years 3 months ago
2006
ACM
Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code whi...