17760 search results - page 250 / 3552 » A Generalization of the Massey-Ding Algorithm |
130
click to vote
SACRYPT
2001
Springer
15 years 9 months ago
2001
Springer
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
117
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Condition based maintenance (CBM) seeks to generate a design for a new ship wide CMB system that performs diagnoses and failure prediction on Navy shipboard machinery. Eventually, ...
138
click to vote
SEAL
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. This paper extends the N-person IPD game into a more interesting game in economics, namely, the oligopoly game. Due to its market share dynamics, the oligopoly game is mo...
147
click to vote
LATIN
2000
Springer
15 years 8 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
144
click to vote
NETWORKS
2008
15 years 4 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...