Sciweavers

1734 search results - page 54 / 347
» its 2000
Sort
View
KBSE
2000
IEEE
15 years 2 months ago
Circular Coinductive Rewriting
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...
Joseph A. Goguen, Kai Lin, Grigore Rosu
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
15 years 1 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
RTSS
2003
IEEE
15 years 3 months ago
A Dynamic Voltage Scaling Algorithm for Sporadic Tasks
Dynamic voltage scaling (DVS) algorithms save energy by scaling down the processor frequency when the processor is not fully loaded. Many algorithms have been proposed for periodi...
Ala' Qadi, Steve Goddard, Shane Farritor
66
Voted
MOC
2000
77views more  MOC 2000»
14 years 9 months ago
Locking-free finite elements for the Reissner-Mindlin plate
Two new families of Reissner-Mindlin triangular finite elements are analyzed. One family, generalizing an element proposed by Zienkiewicz and Lefebvre, approximates (for k 1) the ...
Richard S. Falk, Tong Tu
CSFW
2000
IEEE
15 years 2 months ago
How to Prevent Type Flaw Attacks on Security Protocols
A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. A number o...
James Heather, Gavin Lowe, Steve Schneider