Sciweavers

555 search results - page 67 / 111
» Improved results for a memory allocation problem
Sort
View
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
15 years 4 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
Marc Joye
AAAI
2000
14 years 11 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
QEST
2007
IEEE
15 years 4 months ago
A Petri Net Model for Evaluating Packet Buffering Strategies in a Network Processor
Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri...
Girish B. C., R. Govindarajan
PC
1998
101views Management» more  PC 1998»
14 years 9 months ago
Performing Out-of Core FFTs on Parallel Disk Systems
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
Thomas H. Cormen, David M. Nicol
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 1 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...