2463 search results - page 255 / 493 » Rankings of Directed Graphs |
144
Voted
AIPS
2010
15 years 6 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
145
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
138
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
143
Voted
COMCOM
2006
15 years 3 months ago
2006
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
133
Voted
ORDER
2006
15 years 3 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...