Sciweavers

520 search results - page 44 / 104
» Subset Counting in Trees
Sort
View
AAAI
2006
13 years 9 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
13 years 9 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
CIBCB
2009
IEEE
13 years 9 months ago
A framework for the application of decision trees to the analysis of SNPs data
Data mining is the analysis of experimental datasets to extract trends and relationships that can be meaningful for the user. In genetic studies these techniques have revealed inte...
Linda Fiaschi, Jonathan M. Garibaldi, Natalio Kras...
SEMWEB
2010
Springer
13 years 5 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
FMOODS
2007
13 years 9 months ago
Model Checking of Extended OCL Constraints on UML Models in SOCLe
We present the first tool that offers dynamic verification of extended traints on UML models. It translates a UML model into an Abstract State (ASM) which is transformed by an AS...
John Mullins, Raveca Oarga