6562 search results - page 326 / 1313 » Noetherianity and Combination Problems |
147
click to vote
MFCS
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
149
click to vote
MICAI
2004
Springer
16 years 3 days ago
2004
Springer
We present an optimization algorithm that combines active learning and locally-weighted regression to find extreme points of noisy and complex functions. We apply our algorithm to...
174
click to vote
GCC
2003
Springer
15 years 12 months ago
2003
Springer
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
130
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
The joint replenishment of inventory problem (JRP) requires independence of minor ordering costs. In this paper we propose an evolutionary algorithm (EA) for a modification of the...
147
click to vote
ICCS
2003
Springer
15 years 12 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...