Sciweavers

605 search results - page 71 / 121
» Reducing complexity in tree-like computer interconnection ne...
Sort
View
DAC
2010
ACM
13 years 9 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 10 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
BIOCOMP
2010
13 years 6 months ago
A Model Reduction Technique for Stochastic Biochemical Kinetics
Abstract-- Modeling the intermolecular reactions in a single cell is a critical problem in computational biology. Biochemical reaction systems often involve species in both low and...
Silvana Ilie, Ekaterina Kudashkina
IPPS
2006
IEEE
14 years 2 months ago
RAPID: an end-system aware protocol for intelligent data transfer over lambda grids
Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. To support ...
Amitabha Banerjee, Wu-chun Feng, Biswanath Mukherj...
DSOM
2007
Springer
14 years 2 months ago
Efficient Web Services Event Reporting and Notifications by Task Delegation
Web Services are an XML technology recently viewed as capable of being used for network management. A key aspect of WS in this domain is event reporting. WS-based research in this ...
Aimilios Chourmouziadis, George Pavlou