Sciweavers

2335 search results - page 422 / 467
» Functional Differentiation of Computer Programs
Sort
View
DIAGRAMS
2006
Springer
14 years 1 months ago
Flow Diagrams: Rise and Fall of the First Software Engineering Notation
Drawings of water are the earliest, least abstract forms of flow diagram. Representations of ideal or generalised sequences for manufacturing or actual paths for materials between ...
Stephen J. Morris, O. C. Z. Gotel
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
14 years 1 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
AIPS
2007
13 years 12 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
ARCS
2008
Springer
13 years 11 months ago
An Optimized ZGEMM Implementation for the Cell BE
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...
Timo Schneider, Torsten Hoefler, Simon Wunderlich,...
ASIACRYPT
2008
Springer
13 years 11 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...