Sciweavers

4714 search results - page 597 / 943
» The Complexity of Iterated Multiplication
Sort
View
FPL
2000
Springer
116views Hardware» more  FPL 2000»
15 years 10 months ago
FPGA Implementation of a Prototype WDM On-Line Scheduler
Message sequencing and channel assignment are two important aspects to consider in optimizing the performance of Wavelength Division Multiplexing (WDM) networks. A scheduling techn...
Winnie W. Cheng, Steven J. E. Wilton, Babak Hamidz...
ILP
2000
Springer
15 years 10 months ago
Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
Floriana Esposito, Donato Malerba, Francesca A. Li...
161
Voted
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 10 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
CRYPTO
1991
Springer
150views Cryptology» more  CRYPTO 1991»
15 years 10 months ago
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
Neal Koblitz
TAPSOFT
1991
Springer
15 years 10 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach