Sciweavers

866 search results - page 116 / 174
» On Dynamic Shortest Paths Problems
Sort
View
ICDCSW
2005
IEEE
15 years 3 months ago
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split Agent-Based Method
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
Constandinos X. Mavromoustakis, Helen D. Karatza
FTDCS
2003
IEEE
15 years 3 months ago
Resource- and Quality-Aware Application-Level Service Multicast
—Current multimedia application deployment tends to rely on composable service systems, where a complex multimedia service can be composed dynamically from multiple simpler ones ...
Jingwen Jin, Klara Nahrstedt
SIGMETRICS
2008
ACM
175views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
DARC: dynamic analysis of root causes of latency distributions
OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has bee...
Avishay Traeger, Ivan Deras, Erez Zadok
INFOCOM
2009
IEEE
15 years 4 months ago
ALDO: An Anomaly Detection Framework for Dynamic Spectrum Access Networks
—Dynamic spectrum access has been proposed as a means to share scarce radio resources, and requires devices to follow protocols that use resources in a proper, disciplined manner...
Song Liu, Yingying Chen, Wade Trappe, Larry J. Gre...
AAAI
2008
15 years 3 days ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams