Sciweavers

19700 search results - page 68 / 3940
» DNA-Based Computation Times
Sort
View
JSC
2002
61views more  JSC 2002»
13 years 9 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé
JSA
1998
94views more  JSA 1998»
13 years 9 months ago
Trading computing power with ReGTime
ReGTime1 (Rent Giga ops someTimes) is a software package for an envisioned \computing power market". ReGTime helps customers to search for providers who allow their workstati...
Bernd Dreier, Annja Huber, Theo Ungerer, Markus Za...
MOC
1998
88views more  MOC 1998»
13 years 9 months ago
A space efficient algorithm for group structure computation
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
Edlyn Teske
CNSM
2010
13 years 8 months ago
Rule-based SLA management for revenue maximisation in Cloud Computing Markets
This paper introduces several Business Rules for maximising the revenue of Providers in Cloud Computing Markets. These rules apply in both negotiation and execution time, and enfor...
Mario Macías, Josep Oriol Fitó, Jord...
BIOSYSTEMS
2008
102views more  BIOSYSTEMS 2008»
13 years 9 months ago
A computational model for telomere-dependent cell-replicative aging
Telomere shortening provides a molecular basis for the Hayflick limit. Recent data suggest that telomere shortening also influence mitotic rate. We propose a stochastic growth mod...
R. D. Portugal, M. G. P. Land, Benar Fux Svaiter