5473 search results - page 926 / 1095 » On the graph isomorphism problem |
177
click to vote
ICTAI
2000
IEEE
15 years 10 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...
161
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
161
click to vote
PODS
1991
ACM
15 years 10 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...
193
click to vote
SGP
2007
15 years 8 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
186
click to vote
AAAI
2007
15 years 8 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...