Sciweavers

2636 search results - page 185 / 528
» Linear Programming
Sort
View
ICCD
2008
IEEE
175views Hardware» more  ICCD 2008»
15 years 11 months ago
Contention-aware application mapping for Network-on-Chip communication architectures
- In this paper, we analyze the impact of network contention on the application mapping for tile-based Networkon-Chip (NoC) architectures. Our main theoretical contribution consist...
Chen-Ling Chou, Radu Marculescu
ICCAD
2007
IEEE
106views Hardware» more  ICCAD 2007»
15 years 11 months ago
A general model for performance optimization of sequential systems
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
Dmitry Bufistov, Jordi Cortadella, Michael Kishine...
109
Voted
CVPR
2010
IEEE
15 years 10 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
124
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
WG
2007
Springer
15 years 8 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...