Sciweavers

3356 search results - page 382 / 672
» Computing education for sustainability
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 7 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 7 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 7 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
CORR
2007
Springer
76views Education» more  CORR 2007»
15 years 7 months ago
Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading Channels
Abstract— A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band channels that can...
Prasanna Chaporkar, Kimmo Kansanen, Ralf R. Mü...
CORR
2007
Springer
159views Education» more  CORR 2007»
15 years 7 months ago
Designing a Resource Broker for Heterogeneous Grids
: Grids provide uniform access to aggregations of heterogeneous resources and services such as computers, networks and storage owned by multiple organizations. However, such a dyna...
Srikumar Venugopal, Krishna Nadiminti, Hussein Gib...