Sciweavers

1279 search results - page 46 / 256
» Fast Implementations of Automata Computations
Sort
View
NETWORKING
2007
13 years 9 months ago
The Token Based Switch: Per-Packet Access Authorisation to Optical Shortcuts
Abstract. Our Token Based Switch (TBS) implementation shows that a packetbased admission control system can be used to dynamically select a fast end-to-end connection over a hybrid...
Mihai-Lucian Cristea, Leon Gommans, Li Xu, Herbert...
EUROGP
2007
Springer
175views Optimization» more  EUROGP 2007»
14 years 1 months ago
Fast Genetic Programming on GPUs
As is typical in evolutionary algorithms, fitness evaluation in GP takes the majority of the computational effort. In this paper we demonstrate the use of the Graphics Processing...
Simon Harding, Wolfgang Banzhaf
SC
2003
ACM
14 years 27 days ago
Fast Parallel Non-Contiguous File Access
Many applications of parallel I/O perform non-contiguous file accesses: instead of accessing a single (large) block of data in a file, a number of (smaller) blocks of data scatt...
Joachim Worringen, Jesper Larsson Träff, Hube...
HICSS
2002
IEEE
123views Biometrics» more  HICSS 2002»
14 years 18 days ago
On the Performance of a Survivability Architecture for Networked Computing Systems
This research focuses on the performance and timing behavior of a two level survivability architecture. The lower level of the architecture involves attack analysis based on kernel...
William S. Harrison, Axel W. Krings, Nadine Hanebu...
SIGGRAPH
1994
ACM
13 years 11 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume