Sciweavers

813 search results - page 94 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
EMSOFT
2004
Springer
14 years 2 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
ACTAC
1998
71views more  ACTAC 1998»
13 years 8 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
FCT
2009
Springer
14 years 3 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the authorā€™s knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Andreas Goerdt
RECOMB
2004
Springer
14 years 9 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
HCW
1999
IEEE
14 years 1 months ago
Multiple Cost Optimization for Task Assignment in Heterogeneous Computing Systems Using Learning Automata
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
Raju D. Venkataramana, N. Ranganathan