Sciweavers

3475 search results - page 678 / 695
» Backbones in Optimization and Approximation
Sort
View
SIROCCO
2010
13 years 11 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
HIS
2007
13 years 11 months ago
Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
Crina Grosan, Ajith Abraham
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 11 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
RSS
2007
176views Robotics» more  RSS 2007»
13 years 11 months ago
Active Policy Learning for Robot Planning and Exploration under Uncertainty
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
Ruben Martinez-Cantin, Nando de Freitas, Arnaud Do...
AAAI
2006
13 years 11 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang