Sciweavers

935 search results - page 163 / 187
» A New Statistical Optimization Algorithm for Gate Sizing
Sort
View
ICSM
2003
IEEE
14 years 1 months ago
Library Miniaturization Using Static and Dynamic Information
Moving to smaller libraries can be considered as a relevant task when porting software systems to limited-resource devices (e.g., hand-helds). Library miniaturization will be part...
Giuliano Antoniol, Massimiliano Di Penta
EVOW
2003
Springer
14 years 28 days ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
FCCM
2009
IEEE
115views VLSI» more  FCCM 2009»
13 years 11 months ago
Multi-Core Architecture on FPGA for Large Dictionary String Matching
FPGA has long been considered an attractive platform for high performance implementations of string matching. However, as the size of pattern dictionaries continues to grow, such ...
Qingbo Wang, Viktor K. Prasanna
NETWORKING
2004
13 years 9 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
CVPR
2011
IEEE
12 years 11 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...