Sciweavers

2322 search results - page 152 / 465
» On a game in directed graphs
Sort
View
AAAI
2007
15 years 9 months ago
Visualization and Adjustment of Evaluation Functions Based on Evaluation Values and Win Probability
We present a method of visualizing and adjusting the evaluation functions in game programming in this paper. It is widely recognized that an evaluation function should assign a hi...
Shogo Takeuchi, Tomoyuki Kaneko, Kazunori Yamaguch...
IV
2009
IEEE
107views Visualization» more  IV 2009»
16 years 1 months ago
Multiscale Visual Analysis of Lexical Networks
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
Guillaume Artignan, Mountaz Hascoët, Mathieu ...
APVIS
2001
15 years 8 months ago
Information Visualisation using Composable Layouts and Visual Sets
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....
Tim Pattison, Rudi Vernik, Matthew Phillips
ECEASST
2006
305views more  ECEASST 2006»
15 years 6 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
STACS
2010
Springer
16 years 1 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar