2503 search results - page 328 / 501 » A study of 3-arc graphs |
168
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
156
Voted
DIALM
2005
ACM
15 years 7 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
171
click to vote
STAIRS
2008
15 years 7 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
194
click to vote
PUK
2003
15 years 7 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
142
click to vote
DCG
2008
15 years 6 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...