5889 search results - page 330 / 1178 » Graph Layout Problems |
132
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
165
click to vote
FOCI
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
179
click to vote
ATMOS
2010
15 years 5 months ago
2010
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
173
click to vote
CCCG
2001
15 years 8 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
147
click to vote
SIAMDM
1998
15 years 6 months ago
1998
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...