Sciweavers

1156 search results - page 223 / 232
» Optimal scheduling of task graphs on parallel systems
Sort
View
109
Voted
ICML
1996
IEEE
16 years 14 days ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
120
Voted
ESCIENCE
2006
IEEE
15 years 5 months ago
WISENT: e-Science for Energy Meteorology
Our energy production increasingly depends on renewable energy sources, which impose new challenges for distributed and decentralized systems. One problem is that the availability...
Wilhelm Hasselbring, Detlev Heinemann, Johannes Hu...
89
Voted
LICS
1997
IEEE
15 years 3 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 4 months ago
Fitting multi-planet transit models to photometric time-data series by evolution strategies
In this paper we present the application of an evolution strategy to the problem of detecting multi-planet transit events in photometric time-data series. Planetary transits occur...
Andreas M. Chwatal, Günther R. Raidl, Michael...
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 3 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...