Sciweavers

43264 search results - page 8436 / 8653
» Comparing models of computation
Sort
View
ICST
2009
IEEE
15 years 5 months ago
Using JML Runtime Assertion Checking to Automate Metamorphic Testing in Applications without Test Oracles
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
Christian Murphy, Kuang Shen, Gail E. Kaiser
INFOCOM
2009
IEEE
15 years 5 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
LICS
2009
IEEE
15 years 5 months ago
Qualitative Determinacy and Decidability of Stochastic Games with Signals
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
ASMTA
2009
Springer
104views Mathematics» more  ASMTA 2009»
15 years 5 months ago
Preliminary Results on a Simple Approach to G/G/c-Like Queues
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent...
Alexandre Brandwajn, Thomas Begin
BICOB
2009
Springer
15 years 5 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
« Prev « First page 8436 / 8653 Last » Next »