Sciweavers

4164 search results - page 769 / 833
» Timing model reduction for hierarchical timing analysis
Sort
View
ICRA
2010
IEEE
97views Robotics» more  ICRA 2010»
15 years 4 months ago
Probabilistic motion planning of balloons in strong, uncertain wind fields
—This paper introduces a new algorithm for probabilistic motion planning in arbitrary, uncertain vector fields, with emphasis on high-level planning for Montgolfier´e balloons...
Michael T. Wolf, Lars Blackmore, Yoshiaki Kuwata, ...
PVLDB
2010
97views more  PVLDB 2010»
15 years 4 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
SOCINFO
2010
15 years 4 months ago
Dynamic Context-Sensitive PageRank for Expertise Mining
Abstract. Online tools for collaboration and social platforms have become omnipresent in Web-based environments. Interests and skills of people evolve over time depending in perfor...
Daniel Schall, Schahram Dustdar
SPIRE
2010
Springer
15 years 4 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TPDS
2010
135views more  TPDS 2010»
15 years 4 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat