1047 search results - page 131 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
AIPS
2004
13 years 9 months ago
2004
In this paper we analyze and extend a recently developed "task-swapping procedure" for improving schedules in oversubscribed situations. In such situations, there are ta...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Parallel program design patterns provide users a new way to get parallel programs without much effort. However, it is always a serious limitation for most existing parall...
ACCV
2010
Springer
13 years 3 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
JAIR
2006
13 years 8 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...