5473 search results - page 725 / 1095 » On the graph isomorphism problem |
159
click to vote
AIPS
2000
15 years 8 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
165
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
181
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
155
click to vote
AHSWN
2010
15 years 6 months ago
2010
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...