Sciweavers

983 search results - page 176 / 197
» Negative-Weight Cycle Algorithms
Sort
View
JCT
2008
109views more  JCT 2008»
13 years 9 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
TCAD
2008
93views more  TCAD 2008»
13 years 9 months ago
Transforming Cyclic Circuits Into Acyclic Equivalents
Abstract--Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for certain combinational functions, cyclic circuits that are stable and d...
Osama Neiroukh, Stephen A. Edwards, Xiaoyu Song
TCOM
2008
127views more  TCOM 2008»
13 years 9 months ago
Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
Daniel N. Liu, Michael P. Fitz
DAC
2008
ACM
14 years 11 months ago
ADAM: run-time agent-based distributed application mapping for on-chip communication
Design-time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. This drives the development of run-time adaptive s...
Jörg Henkel, Mohammad Abdullah Al Faruque, Ru...
DAC
2000
ACM
14 years 10 months ago
Unifying behavioral synthesis and physical design
eously demand shorter and less costly design cycles. Designing at higher levels of abstraction makes both objectives achievable, but enabling techniques like behavioral synthesis h...
William E. Dougherty, Donald E. Thomas