Sciweavers

CP
2011
Springer
12 years 7 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
CP
2011
Springer
12 years 7 months ago
Optimal Carpet Cutting
Abstract. In this paper we present a model for the carpet cutting problem in which carpet shapes are cut from a rectangular carpet roll with a fixed width and sufficiently long le...
Andreas Schutt, Peter J. Stuckey, Andrew R. Verden
CP
2011
Springer
12 years 7 months ago
Incorporating Variance in Impact-Based Search
We present a simple modification to the idea of impact-based search which has proven highly effective for several applications. Impacts measure the average reduction in search spa...
Serdar Kadioglu, Eoin O'Mahony, Philippe Refalo, M...
CP
2011
Springer
12 years 7 months ago
CP Models for Maximum Common Subgraph Problems
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
Samba Ndojh Ndiaye, Christine Solnon
CEC
2011
IEEE
12 years 7 months ago
Differential evolution with multiple strategies for solving CEC2011 real-world numerical optimization problems
—Over the last two decades, many Differential Evolution (DE) strategies have been introduced for solving Optimization Problems. Due to the variability of the characteristics in o...
Saber M. Elsayed, Ruhul A. Sarker, Daryl Essam
CEC
2011
IEEE
12 years 7 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
CEC
2011
IEEE
12 years 7 months ago
Accelerating convergence towards the optimal pareto front
—Evolutionary algorithms have been very popular optimization methods for a wide variety of applications. However, in spite of their advantages, their computational cost is still ...
Mohsen Davarynejad, Jafar Rezaei, Jos L. M. Vranck...
CEC
2011
IEEE
12 years 7 months ago
Stochastic Natural Gradient Descent by estimation of empirical covariances
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
Luigi Malagò, Matteo Matteucci, Giovanni Pi...
CEC
2011
IEEE
12 years 7 months ago
On universal search strategies for multi-criteria optimization using weighted sums
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
Julien Legriel, Scott Cotton, Oded Maler