Sciweavers

250 search results - page 18 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
14 years 9 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
AAAI
2007
14 years 11 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
AAIM
2008
Springer
94views Algorithms» more  AAIM 2008»
15 years 3 months ago
Speed Scaling with a Solar Cell
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
IPCCC
2006
IEEE
15 years 3 months ago
Maille authorization - a distributed, redundant authorization protocol
The Maille Authorization protocol provides flexible and reliable authorization in large distributed and pervasive computing systems. Service owners distribute their access control...
Andrew Fritz, Jehan-François Pâris
94
Voted
HPDC
2008
IEEE
14 years 9 months ago
Code coverage, performance approximation and automatic recognition of idioms in scientific applications
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
Jiahua He, Allan Snavely, Rob F. Van der Wijngaart...