874 search results - page 5 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
157
Voted
PAAMS
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
211
click to vote
IJCAI
2007
15 years 7 months ago
2007
Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between ima...
155
Voted
AIPS
2009
15 years 7 months ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
149
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...
203
click to vote
IEEECIT
2005
IEEE
15 years 12 months ago
2005
IEEE
Subject to limited computational resource, feedback scheduling aims to improve, or to optimize, the global control performance of real-time control systems. For the system that co...