Sciweavers

491 search results - page 11 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
DBA
2006
156views Database» more  DBA 2006»
13 years 9 months ago
Simulated Annealing for Materialized View Selection in Data Warehousing Environment
In order to facilitate query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize prese...
Roozbeh Derakhshan, Frank K. H. A. Dehne, Othmar K...
ISSRE
2003
IEEE
14 years 1 months ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
14 years 4 days ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
ICCTA
2007
IEEE
13 years 11 months ago
Faster Placer for Island-Style FPGAs
In this paper, we propose a placement method for islandstyle FPGAs, based on fast yet very good initial placement followed by refinement using ultra-low temperature Simulated Anne...
Pritha Banerjee, Susmita Sur-Kolay
ICCD
1997
IEEE
123views Hardware» more  ICCD 1997»
14 years 2 days ago
A Parallel Circuit-Partitioned Algorithm for Timing Driven Cell Placement
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process. All previous work in parallel simulated annealing bas...
John A. Chandy, Prithviraj Banerjee