Sciweavers

7648 search results - page 610 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
AGI
2008
15 years 8 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
PLDI
2011
ACM
14 years 9 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in ā€œregularā€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
PROCEDIA
2010
123views more  PROCEDIA 2010»
15 years 5 months ago
An adaptive model switching and discretization algorithm for gas flow on networks
We are interested in the simulation and optimization of gas transport in networks. Those networks consist of pipes and various other components like compressor stations and valves...
Pia Domschke, Oliver Kolb, Jens Lang
CEC
2007
IEEE
16 years 1 months ago
Computational intelligence algorithms for risk-adjusted trading strategies
Abstract— This paper investigates the performance of trading strategies identified through Computational Intelligence techniques. We focus on trading rules derived by Genetic Pr...
Nicos G. Pavlidis, E. G. Pavlidis, Michael G. Epit...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 10 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte