Sciweavers

1403 search results - page 110 / 281
» About Approximations of Exponentials
Sort
View
NCA
2009
IEEE
15 years 11 months ago
Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...
Steve Thompson, Lester Lipsky, Sarah Tasneem, Feng...
ATAL
2009
Springer
15 years 11 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
COCOON
2009
Springer
15 years 11 months ago
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
Ivona Bezáková, Nayantara Bhatnagar,...
INFOSCALE
2009
ACM
15 years 11 months ago
Measuring IP Address Fragmentation from BGP Routing Dynamics
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
Xia Yin, Xin Wu, Zhiliang Wang
ANSS
2008
IEEE
15 years 11 months ago
A Simulation Study of Common Mobility Models for Opportunistic Networks
Understanding mobility characteristics is important for the design and analysis of routing schemes for mobile ad hoc networks (MANETs). This is especially true for mobile opportun...
Muhammad Abdulla, Robert Simon