Sciweavers

11565 search results - page 1942 / 2313
» Computing Minimal Mappings
Sort
View
FPGA
2004
ACM
121views FPGA» more  FPGA 2004»
16 years 7 days ago
Highly pipelined asynchronous FPGAs
We present the design of a high-performance, highly pipelined asynchronous FPGA. We describe a very fine-grain pipelined logic block and routing interconnect architecture, and sh...
John Teifel, Rajit Manohar
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
16 years 7 days ago
Evolving En-Route Caching Strategies for the Internet
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network ...
Jürgen Branke, Pablo Funes, Frederik Thiele
IDEAL
2004
Springer
16 years 6 days ago
Kernel Density Construction Using Orthogonal Forward Regression
Abstract— The paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model gener...
Sheng Chen, Xia Hong, Chris J. Harris
ISOLA
2004
Springer
16 years 6 days ago
Designing Safe, Reliable Systems using Scade
As safety critical systems increase in size and complexity, the need for efficient tools to verify their reliability grows. In this paper we present a tool that helps engineers des...
Parosh Aziz Abdulla, Johan Deneaux, Gunnar St&arin...
IWMM
2004
Springer
90views Hardware» more  IWMM 2004»
16 years 6 days ago
Automatic heap sizing: taking real memory into account
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application’s needs causes excessive GC overhead, while a heap tha...
Ting Yang, Matthew Hertz, Emery D. Berger, Scott F...
« Prev « First page 1942 / 2313 Last » Next »