216 search results - page 25 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
IJWGS
2006
13 years 7 months ago
2006
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
SMA
2009
ACM
14 years 2 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
DAM
2011
13 years 2 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
GECCO
2009
Springer
14 years 9 days ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
ICRA
2000
IEEE
14 years 3 days ago
2000
IEEE
In this paper, we investigate methods for enabling a human operator and an automatic motion planner to cooperatively solve a motion planning query. Our work is motivated by our ex...