Sciweavers

16430 search results - page 2773 / 3286
» On Computable Tree Functions
Sort
View
BMCBI
2004
141views more  BMCBI 2004»
15 years 7 months ago
Estimates of statistical significance for comparison of individual positions in multiple sequence alignments
Background: Profile-based analysis of multiple sequence alignments (MSA) allows for accurate comparison of protein families. Here, we address the problems of detecting statistical...
Ruslan Sadreyev, Nick V. Grishin
CCE
2004
15 years 7 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
CCR
2002
62views more  CCR 2002»
15 years 7 months ago
An enforced inter-admission delay performance-driven connection admission control algorithm
Connection Admission Control (CAC) is an important function in a computer network that supports Quality of Service (QoS). The function of CAC is to decide whether a new connection...
Stanislav Belenki
ENTCS
2002
84views more  ENTCS 2002»
15 years 6 months ago
Programming Autonomous Robots in Curry
In this paper we present a framework to program autonomous robots in the declarative multi-paradigm language Curry. This is an experiment to use high-level declarative programming...
Michael Hanus, Klaus Höppner
JSA
2000
175views more  JSA 2000»
15 years 6 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
« Prev « First page 2773 / 3286 Last » Next »