Sciweavers

1552 search results - page 289 / 311
» On the Complexity of Constant Propagation
Sort
View
CIBCB
2007
IEEE
15 years 6 months ago
Modeling protein-DNA binding time in Stochastic Discrete Event Simulation of Biological Processes
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 6 months ago
Quality of Service in Wireless Network Diversity Multiple Access Protocols Based on a Virtual Time-Slot Allocation
— In this paper, we propose a new resource allocation mechanism which is designed to improve the multiuser detection of wireless network diversity multiple access (NDMA) protocol...
Ramiro Samano-Robles, Mounir Ghogho, Desmond C. Mc...
ICNP
2007
IEEE
15 years 6 months ago
Inferring the Origin of Routing Changes using Link Weights
— The global Internet routing infrastructure is a large and complex distributed system where routing changes occur constantly. Our objective in this paper is to develop a simple ...
Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lix...
GTTSE
2007
Springer
15 years 6 months ago
Model Transformations for the Compilation of Multi-processor Systems-on-Chip
With the increase of amount of transistors which can be contained on a chip and the constant expectation for more sophisticated applications, the design of Systems-on-Chip (SoC) is...
Éric Piel, Philippe Marquet, Jean-Luc Dekey...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
15 years 6 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...