Sciweavers

1258 search results - page 76 / 252
» Architecture-driven Problem Decomposition
Sort
View
MP
2006
110views more  MP 2006»
13 years 9 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
14 years 9 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
INFORMATICASI
2007
89views more  INFORMATICASI 2007»
13 years 9 months ago
Approximate Representation of Textual Documents in the Concept Space
In this paper we deal with the problem of addition of new documents in collection when documents are represented in lower dimensional space by concept indexing. Concept indexing i...
Jasminka Dobsa, Bojana Dalbelo Basic
CDC
2010
IEEE
103views Control Systems» more  CDC 2010»
13 years 4 months ago
Energy conservation and interference mitigation: From decoupling property to win-win strategy
This paper studies the problem of energy conservation of mobile terminals in a multi-cell TDMA network supporting real-time sessions. The corresponding optimization problem involv...
Liqun Fu, Hongseok Kim, Jianwei Huang, Soung Chang...
CVPR
2008
IEEE
14 years 11 months ago
Image decomposition into structure and texture subcomponents with multifrequency modulation constraints
Texture information in images is coupled with geometric macrostructures and piecewise-smooth intensity variations. Decomposing an image f into a geometric structure component u an...
Georgios Evangelopoulos, Petros Maragos