Sciweavers

10996 search results - page 329 / 2200
» Future Directions in Computing
Sort
View
223
Voted
ISPAN
2002
IEEE
15 years 11 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
189
Voted
GECCO
2010
Springer
152views Optimization» more  GECCO 2010»
15 years 11 months ago
Importing the computational neuroscience toolbox into neuro-evolution-application to basal ganglia
Neuro-evolution and computational neuroscience are two scientific domains that produce surprisingly different artificial neural networks. Inspired by the “toolbox” used by ...
Jean-Baptiste Mouret, Stéphane Doncieux, Be...
184
Voted
INFOCOM
1998
IEEE
15 years 11 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
CASES
2009
ACM
15 years 4 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
BC
2006
80views more  BC 2006»
15 years 6 months ago
Sparse Spatial Sampling for the Computation of Motion in Multiple Stages
The avian retino-tecto-rotundal pathway plays a central role in motion analysis and features complex connectivity. Yet, the relation between the pathway's structural arrangeme...
Alireza S. Mahani, Reza Khanbabaie, Harald Luksch,...