Sciweavers

2057 search results - page 30 / 412
» Quadratic placement using an improved timing model
Sort
View
FPL
2010
Springer
124views Hardware» more  FPL 2010»
13 years 6 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson
FPGA
1999
ACM
115views FPGA» more  FPGA 1999»
14 years 22 days ago
Using Cluster-Based Logic Blocks and Timing-Driven Packing to Improve FPGA Speed and Density
In this paper, we investigate the speed and area-efficiency of FPGAs employing “logic clusters” containing multiple LUTs and registers as their logic block. We introduce a ne...
Alexander Marquardt, Vaughn Betz, Jonathan Rose
IJCAI
2003
13 years 9 months ago
Multi-prototype Support Vector Machine
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
Fabio Aiolli, Alessandro Sperduti
CCE
2007
13 years 8 months ago
Water networks security: A two-stage mixed-integer stochastic program for sensor placement under uncertainty
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...
Vicente Rico-Ramírez, Sergio Frausto-Hern&a...
CGO
2005
IEEE
14 years 2 months ago
Compiler Managed Dynamic Instruction Placement in a Low-Power Code Cache
Modern embedded microprocessors use low power on-chip memories called scratch-pad memories to store frequently executed instructions and data. Unlike traditional caches, scratch-p...
Rajiv A. Ravindran, Pracheeti D. Nagarkar, Ganesh ...