1092 search results - page 122 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
124
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
143
click to vote
ESA
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
268
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
163
Voted
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
166
click to vote
AIPS
2008
15 years 8 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...