2084 search results - page 398 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
100
Voted
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
ICASSP
2009
IEEE
14 years 7 months ago
2009
IEEE
Recently, the covariance region descriptor [1] has been proved robust and versatile for a modest computational cost. It enables efficient fusion of different types of features. Ba...
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we investigate multi-agent learning (MAL) in a multi-agent resource selection problem (MARS) in which a large group of agents are competing for common resources. Si...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...