1402 search results - page 70 / 281 » Searching Cycle-Disjoint Graphs |
142
click to vote
JGAA
2002
15 years 3 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
125
click to vote
AIPS
2008
15 years 6 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
134
click to vote
OPODIS
2008
15 years 5 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
140
click to vote
SC
2005
ACM
15 years 9 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
118
click to vote
CAEPIA
2007
Springer
15 years 8 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...