875 search results - page 70 / 175 » On Reachability Under Uncertainty |
153
click to vote
LATIN
2010
Springer
16 years 24 days ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
185
click to vote
ICNP
2005
IEEE
15 years 11 months ago
2005
IEEE
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14,15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP...
147
click to vote
CAV
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
142
click to vote
IJBIS
2010
15 years 3 months ago
2010
Discounted cash flow (DCF) is the most accepted approach for company valuation. It is well grounded in theory and practice. However, the DCF approach, which is commonly used for t...
266
Voted
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- The inherent uncertainty of data present in numerous applications such as sensor databases, text annotations, and information retrieval motivate the need to handle impre...