Sciweavers

1677 search results - page 45 / 336
» On the Completeness of Quantum Computation Models
Sort
View
ICNS
2006
IEEE
15 years 7 months ago
Promise theory - a model of autonomous objects for pervasive computing and swarms
Abstract— The theory of promises describes policy governed services, in a framework of completely autonomous agents, which assist one another by voluntary cooperation alone. We p...
Mark Burgess, Siri Fagernes
TIT
2008
105views more  TIT 2008»
14 years 12 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
CIE
2009
Springer
15 years 8 months ago
Computational Heuristics for Simplifying a Biological Model
Abstract. Computational biomodelers adopt either of the following approaches: build rich, as complete as possible models in an effort to obtain very realistic models, or on the co...
Ion Petre, Andrzej Mizera, Ralph-Johan Back
SPAA
2003
ACM
15 years 6 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
RTCSA
1999
IEEE
15 years 5 months ago
Incorporating Error Recovery into the Imprecise Computation Model
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
Hakan Aydin, Rami G. Melhem, Daniel Mossé