Sciweavers

1686 search results - page 44 / 338
» Programs as polygraphs: computability and complexity
Sort
View
RECOMB
2006
Springer
15 years 10 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
IPPS
2007
IEEE
15 years 4 months ago
Coordinating Data Parallel SAC Programs with S-Net
We propose a two-layered approach for exploiting different forms of concurrency in complex systems: We specify computational components in our functional array language SaC, whic...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
66
Voted
HUMAN
2003
Springer
15 years 2 months ago
A Study on Monitoring and Protecting Computer System against Interception Threat
Perfect protection against all system threats is considered to be impossible. The problem of monitoring against the threats has been an issue in literature, but its progress has no...
Seongje Cho, Chulyean Chang, Joonmo Kim, Jongmoo C...
IFIP
1993
Springer
15 years 1 months ago
Plant Engineering: Conceptual Modeling and Modular Design of a Computer Aided Environment
When designing a plant for continuous or semi-continuous processes, such as paper pulp or petrochemical production systems, engineers face very complex tasks, which are only in pa...
Cláudio Walter, José Palazzo M. de O...
ENTCS
2008
102views more  ENTCS 2008»
14 years 9 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...