923 search results - page 12 / 185 » The Computational Structure of Progress Conditions |
75
Voted
BMCBI
2005
14 years 9 months ago
2005
Background: Currently available methods to predict splice sites are mainly based on the independent and progressive alignment of transcript data (mostly ESTs) to the genomic seque...
GG
2008
Springer
14 years 10 months ago
2008
Springer
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The RTSJ memory model propose a mechanism based on a scope three containing all region-stacks in the system and a reference-counter collector. In order to avoid reference cycles a...
105
click to vote
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Bayesian networks are a powerful probabilistic representation, and their use for classification has received considerable attention. However, they tend to perform poorly when lear...
AUTOMATICA
2010
14 years 9 months ago
2010
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...