Sciweavers

451 search results - page 40 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
13 years 9 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
ECCV
2004
Springer
14 years 2 months ago
Combining Simple Models to Approximate Complex Dynamics
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
Leonid Taycher, John W. Fisher III, Trevor Darrell
CONCUR
1999
Springer
14 years 29 days ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
TON
2008
139views more  TON 2008»
13 years 8 months ago
Stochastic learning solution for distributed discrete power control game in wireless data networks
Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. Th...
Yiping Xing, Rajarathnam Chandramouli
NIPS
2007
13 years 10 months ago
Topmoumoute Online Natural Gradient Algorithm
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
Nicolas Le Roux, Pierre-Antoine Manzagol, Yoshua B...