Sciweavers

1453 search results - page 17 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
JMLR
2012
11 years 10 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
MP
2006
123views more  MP 2006»
13 years 7 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
CEC
2008
IEEE
14 years 2 months ago
Examination of multi-objective optimization method for global search using DIRECT and GA
— A number of multi-objective genetic algorithms (MOGAs) have been developed to obtain Pareto optimal solutions for multi-objective optimization problems. However, as these metho...
Luyi Wang, Hiroyuki Ishida, Tomoyuki Hiroyasu, Mit...
CEC
2010
IEEE
13 years 7 months ago
Sequential DE enhanced by neighborhood search for Large Scale Global Optimization
— In this paper, the performance of a sequential Differential Evolution (DE) enhanced by neighborhood search (SDENS) is reported on the set of benchmark functions provided for th...
Hui Wang, Zhijian Wu, Shahryar Rahnamayan, Dazhi J...
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 7 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein