Sciweavers

9067 search results - page 1728 / 1814
» Adaptive Model Checking
Sort
View
CCR
2005
76views more  CCR 2005»
15 years 6 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
JOC
2000
181views more  JOC 2000»
15 years 6 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
NN
2000
Springer
152views Neural Networks» more  NN 2000»
15 years 6 months ago
A neural network theory of proportional analogy-making
A neural network model that can simulate the learning of some simple proportional analogies is presented. These analogies include, for example, (a) red-square:red-circle yellow-sq...
Nilendu G. Jani, Daniel S. Levine
JOOP
1998
98views more  JOOP 1998»
15 years 5 months ago
Design Patterns as Language Constructs
Design patterns have proven to be very useful for the design of object-oriented systems. The power of design patterns stems from their ability to provide generic solutions to reap...
Jan Bosch
MP
2002
143views more  MP 2002»
15 years 5 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
« Prev « First page 1728 / 1814 Last » Next »