3142 search results - page 183 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
132
click to vote
MP
2006
15 years 3 months ago
2006
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...
113
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
122
click to vote
WCE
2007
15 years 4 months ago
2007
Abstract—In this work we present a variational formulation for a multilayer perceptron neural network. With this formulation any learning task for the neural network is defined ...
135
Voted
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
135
Voted
AAAI
2012
13 years 6 months ago
2012
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...