Sciweavers

2020 search results - page 103 / 404
» Speeding up Slicing
Sort
View
108
Voted
FPGA
2006
ACM
100views FPGA» more  FPGA 2006»
15 years 4 months ago
A generic lookup cache architecture for network processing applications
Abstract-- In this paper, we introduce a novel architecture for constructing caches for lookup operations that are used in a variety of network processing applications. The disting...
Janardhan Singaraju, John A. Chandy
99
Voted
ESOP
2000
Springer
15 years 4 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
118
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
Analysis and Optimization of the TWINKLE Factoring Device
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field S...
Arjen K. Lenstra, Adi Shamir
112
Voted
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
15 years 4 months ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
AAAI
2007
15 years 3 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling