6562 search results - page 184 / 1313 » Noetherianity and Combination Problems |
173
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
Many algorithms such as Q-learning successfully address reinforcement learning in single-agent multi-time-step problems. In addition there are methods that address reinforcement l...
155
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
196
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
198
click to vote
COMPOS
1997
Springer
15 years 10 months ago
1997
Springer
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parall...
168
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
The paper is devoted to the problems of using the algorithms in expert systems of choice in the investment projects; singularities of such algorithms and their functioning in diff...