1074 search results - page 114 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
124
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
154
Voted
CN
2006
15 years 3 months ago
2006
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
147
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
118
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
135
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...