106
click to vote
RTAS
2011
IEEE
14 years 17 days ago
2011
IEEE
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
111
click to vote
RTA
2011
Springer
14 years 17 days ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
154
click to vote
RTA
2011
Springer
14 years 17 days ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
132
click to vote
RSFDGRC
2011
Springer
14 years 17 days ago
2011
Springer
WINACS (Web-based Information Network Analysis for Computer Science) is a project that incorporates many recent, exciting developments in data sciences to construct a Web-based co...
146
click to vote
RSFDGRC
2011
Springer
14 years 17 days ago
2011
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In interval comp...
RSA
2011
14 years 17 days ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
152
click to vote
REST
2011
ACM
14 years 17 days ago
2011
ACM
At a first glance there might appear to be an obvious alignment and overlap between the approaches prescribed by REST and Linked Data. On more detailed inspection divergences in ...
194
click to vote
RECOMB
2011
Springer
14 years 17 days ago
2011
Springer
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...