Sciweavers

230 search results - page 17 / 46
» Quantum Search with Variable Times
Sort
View
ATAL
2006
Springer
15 years 4 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
122
Voted
AIPS
2007
15 years 2 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
94
Voted
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
15 years 1 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
GECCO
2003
Springer
118views Optimization» more  GECCO 2003»
15 years 5 months ago
Distributed Probabilistic Model-Building Genetic Algorithm
In this paper, a new model of Probabilistic Model-Building Genetic Algorithms (PMBGAs), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design var...
Tomoyuki Hiroyasu, Mitsunori Miki, Masaki Sano, Hi...
102
Voted
ICANN
2001
Springer
15 years 4 months ago
A Computational Intelligence Approach to Optimization with Unknown Objective Functions
In many practical engineering design problems, the form of objective function is not given explicitly in terms of design variables. Given the value of design variables, under this ...
Hirotaka Nakayama, Masao Arakawa, Rie Sasaki