Sciweavers

1983 search results - page 254 / 397
» Competitive graph searches
Sort
View
AAAI
2010
13 years 9 months ago
Symmetry Detection in General Game Playing
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
Stephan Schiffel
NAACL
2007
13 years 9 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
NIPS
2003
13 years 9 months ago
Salient Boundary Detection using Ratio Contour
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
Song Wang, Toshiro Kubota, Jeffrey Mark Siskind
PUK
2000
13 years 9 months ago
4SP: A four stage incremental planning approach
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
Eva Onaindia, Laura Sebastia, Eliseo Marzal
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 8 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...