Sciweavers

250 search results - page 1 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
RTSS
2009
IEEE
13 years 11 months ago
Verifying Tolerant Systems Using Polynomial Approximations
Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh ...
ATAL
2009
Springer
13 years 11 months ago
Combining fault injection and model checking to verify fault tolerance in multi-agent systems
The ability to guarantee that a system will continue to operate correctly under degraded conditions is key to the success of adopting multi-agent systems (MAS) as a paradigm for d...
Jonathan Ezekiel, Alessio Lomuscio
GLOBECOM
2009
IEEE
13 years 8 months ago
Joint Base Station Placement and Fault-Tolerant Routing in Wireless Sensor Networks
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
Dejun Yang, Satyajayant Misra, Guoliang Xue
ADCM
2008
187views more  ADCM 2008»
13 years 4 months ago
Approximation on the sphere using radial basis functions plus polynomials
In this paper we analyse a hybrid approximation of functions on the sphere S2 R3 by radial basis functions combined with polynomials, with the radial basis functions assumed to be...
Ian H. Sloan, Alvise Sommariva
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
13 years 10 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...