Sciweavers

941 search results - page 129 / 189
» The Parking Permit Problem
Sort
View
CP
2001
Springer
15 years 4 months ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
15 years 4 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
LCPC
2001
Springer
15 years 4 months ago
Computing Array Shapes in MATLAB
This paper deals with the problem of statically inferring the shape of an array in languages such as MATLAB. Inferring an array’s shape is desirable because it empowers better co...
Pramod G. Joisha, U. Nagaraj Shenoy, Prithviraj Ba...
UML
2001
Springer
15 years 4 months ago
Representing Embedded System Sequence Diagrams as a Formal Language
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
Elizabeth Latronico, Philip Koopman
UML
2001
Springer
15 years 4 months ago
Refactoring UML Models
Software developers spend most of their time modifying and maintaining existing products. This is because systems, and consequently their design, are in perpetual evolution before ...
Gerson Sunyé, Damien Pollet, Yves Le Traon,...