Sciweavers

110 search results - page 1 / 22
» Combinatorial synthesis approach employing graph networks
Sort
View
AEI
2008
108views more  AEI 2008»
13 years 4 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
13 years 9 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding
IOR
2011
175views more  IOR 2011»
12 years 11 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
CORR
2010
Springer
204views Education» more  CORR 2010»
13 years 4 months ago
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
Yuan Liu, Meixia Tao, Bin Li, Hui Shen
CONCUR
2005
Springer
13 years 10 months ago
A Compositional Approach to the Stochastic Dynamics of Gene Networks
We propose a compositional approach to the dynamics of gene regulatory networks based on the stochastic π-calculus, and develop a representation of gene network elements which can...
Luca Cardelli