Sciweavers

3838 search results - page 65 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
NIPS
2001
15 years 2 months ago
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...
93
Voted
GCC
2003
Springer
15 years 5 months ago
An Evolutionary Constraint Satisfaction Solution for over the Cell Channel Routing
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
Ahmet Ünveren, Adnan Acan
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 1 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
99
Voted
WSCG
2004
161views more  WSCG 2004»
15 years 2 months ago
Rendering Techniques for Hardware-Accelerated Image-Based CSG
Image-based CSG rendering algorithms for standard graphics hardware rely on multipass rendering that includes reading and writing large amounts of pixel data from and to the frame...
Florian Kirsch, Jürgen Döllner
149
Voted
MDM
2010
Springer
188views Communications» more  MDM 2010»
14 years 11 months ago
A Distributed Technique for Dynamic Operator Placement in Wireless Sensor Networks
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Georgios Chatzimilioudis, Nikos Mamoulis, Dimitrio...