Sciweavers

3875 search results - page 774 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
WSC
2004
13 years 6 months ago
Automation of Human Decision Processes for Route Completion for Airspace Design Analysis
This paper describes an algorithm for approximating missing data in air traffic routes thereby allowing the lengths of different routes to be compared for our simulation analyses....
Lisa A. Schaefer
SIGMETRICS
2010
ACM
193views Hardware» more  SIGMETRICS 2010»
13 years 5 months ago
Distributed caching over heterogeneous mobile networks
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
Stratis Ioannidis, Laurent Massoulié, Augus...
BMCBI
2008
242views more  BMCBI 2008»
13 years 5 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
BMCBI
2007
134views more  BMCBI 2007»
13 years 5 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
IJAR
2008
118views more  IJAR 2008»
13 years 5 months ago
Dynamic multiagent probabilistic inference
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
Xiangdong An, Yang Xiang, Nick Cercone