5889 search results - page 1008 / 1178 » Graph Layout Problems |
155
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
186
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
164
click to vote
ICPR
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
171
click to vote
ICTAI
2000
IEEE
15 years 9 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
157
click to vote
PODS
1991
ACM
15 years 9 months ago
1991
ACM
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...