Sciweavers

466 search results - page 88 / 94
» A Worst Case Timing Analysis Technique for Optimized Program...
Sort
View
JPDC
2008
122views more  JPDC 2008»
13 years 8 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
EURODAC
1994
IEEE
209views VHDL» more  EURODAC 1994»
14 years 17 days ago
MOS VLSI circuit simulation by hardware accelerator using semi-natural models
- The accelerator is destined to circuit-level simulation of digital and analog/digital MOS VLSI'c containing of up to 100 thousand transistors (with 16 Mb RAM host-machine). ...
Victor V. Denisenko
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
13 years 9 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
BMCBI
2006
164views more  BMCBI 2006»
13 years 8 months ago
Evaluation of clustering algorithms for gene expression data
Background: Cluster analysis is an integral part of high dimensional data analysis. In the context of large scale gene expression data, a filtered set of genes are grouped togethe...
Susmita Datta, Somnath Datta
TCS
2008
13 years 8 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman