2657 search results - page 113 / 532 » On the complexity of hierarchical problem solving |
111
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
108
click to vote
AIPS
1994
15 years 2 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
114
click to vote
MP
2008
15 years 1 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
93
Voted
FSTTCS
2008
Springer
15 years 2 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
100
click to vote
EOR
2007
15 years 1 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...