Sciweavers

7504 search results - page 869 / 1501
» Computing with Action Potentials
Sort
View
AUTOMATICA
2006
97views more  AUTOMATICA 2006»
15 years 7 months ago
Receding horizon control applied to optimal mine planning
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...
Graham C. Goodwin, María M. Seron, Richard ...
HEURISTICS
2008
153views more  HEURISTICS 2008»
15 years 7 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
Jakob Puchinger, Günther R. Raidl
FGCS
2006
119views more  FGCS 2006»
15 years 7 months ago
Simulation tools to study a distributed shared memory for clusters of symmetric multiprocessors
Distributed shared memory (DSM) systems have become popular as a means of utilizing clusters of computers for solving large applications. We have developed a high-performance DSM,...
Darshan Thaker, Vipin Chaudhary
IIE
2006
113views more  IIE 2006»
15 years 7 months ago
Gender and Programming Contests: Mitigating Exclusionary Practices
Individuals vary across many dimensions due to the effects of gender-based, personality, and cultural differences. Consequently, programming contests with a limited and rigid stru...
Maryanne Fisher, Anthony Cox
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...