Sciweavers

266 search results - page 7 / 54
» On asymmetric progress conditions
Sort
View
DISOPT
2006
101views more  DISOPT 2006»
14 years 11 months ago
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Gareth Bendall, François Margot
88
Voted
ARTS
1999
Springer
15 years 3 months ago
Verifying Progress in Timed Systems
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...
Stavros Tripakis
NECO
2002
100views more  NECO 2002»
14 years 10 months ago
Robust Regression with Asymmetric Heavy-Tail Noise Distributions
In the presence of a heavy-tail noise distribution, regression becomes much more di cult. Traditional robust regression methods assume that the noise distribution is symmetric and...
Ichiro Takeuchi, Yoshua Bengio, Takafumi Kanamori
VTC
2008
IEEE
186views Communications» more  VTC 2008»
15 years 5 months ago
Downlink Limited Feedback Transmission Schemes for Asymmetric MIMO Channels
Abstract—In multiple-input multiple-output (MIMO) broadcast channels, multiuser diversity is exploited by scheduling data transmission to users with best channel conditions. To ï...
Mohsen Eslami, Witold A. Krzymien
EUROPAR
2006
Springer
15 years 2 months ago
Master-Slave Tasking on Asymmetric Networks
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of inde...
Cyril Banino-Rokkones, Olivier Beaumont, Lasse Nat...