Sciweavers

427 search results - page 15 / 86
» Computing the Local Consensus of Trees
Sort
View
60
Voted
IWCIA
2004
Springer
15 years 2 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
ACG
2009
Springer
15 years 4 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
96
Voted
UAI
1992
14 years 10 months ago
Exploring Localization in Bayesian Networks for Large Expert Systems
Current Bayesian net representations do not consider structure in the domain and include all variables in a homogeneous network. At any time, a human reasoner in a large domain ma...
Yang Xiang, David Poole, Michael P. Beddoes
GECCO
2010
Springer
154views Optimization» more  GECCO 2010»
15 years 2 months ago
Evolutionary learning in networked multi-agent organizations
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...
Jae-Woo Kim