8486 search results - page 1533 / 1698 » Ordered Enumeration Method |
144
click to vote
FCCM
1999
IEEE
15 years 9 months ago
1999
IEEE
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
160
click to vote
RECOMB
1999
Springer
15 years 9 months ago
1999
Springer
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
140
Voted
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
182
click to vote
SIGGRAPH
1997
ACM
15 years 9 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
120
click to vote
ICCAD
1996
IEEE
15 years 9 months ago
1996
IEEE
This paper presents a new framework for formal logic verification. What is depicted here is fundamentally different from previous approaches. In earlier approaches, the circuit is ...