Sciweavers

2044 search results - page 36 / 409
» System theory for numerical analysis
Sort
View
CODES
2010
IEEE
13 years 6 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
TPDS
2010
135views more  TPDS 2010»
13 years 6 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
AISC
1998
Springer
14 years 22 days ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
OTM
2005
Springer
14 years 2 months ago
JXTA Messaging: Analysis of Feature-Performance Tradeoffs and Implications for System Design
Abstract. With the rise of Peer-to-Peer and Grid infrastructures, there is a renewed interest in messaging systems. Among the numerous messaging solutions for large loosely coupled...
Emir Halepovic, Ralph Deters, Bernard Traversat
HYBRID
2007
Springer
14 years 2 months ago
Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
Alessandro Abate, Saurabh Amin, Maria Prandini, Jo...