Sciweavers

5448 search results - page 787 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
TC
2008
15 years 6 months ago
Self-Adaptive Configuration of Visualization Pipeline Over Wide-Area Networks
Next-generation scientific applications require the capability to visualize large archival data sets or on-going computer simulations of physical and other phenomena over wide-area...
Qishi Wu, Jinzhu Gao, Mengxia Zhu, Nageswara S. V....
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 6 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
NN
2002
Springer
123views Neural Networks» more  NN 2002»
15 years 6 months ago
Neuromodulation and plasticity in an autonomous robot
In this paper we implement a computational model of a neuromodulatory system in an autonomous robot. The output of the neuromodulatory system acts as a value signal, modulating wi...
Olaf Sporns, William H. Alexander
153
Voted
CG
2010
Springer
15 years 4 months ago
A Principled Method for Exploiting Opening Books
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
IPPS
2005
IEEE
16 years 9 days ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch