Sciweavers

507 search results - page 35 / 102
» Sizes of Ordered Decision Trees
Sort
View
FSTTCS
2005
Springer
14 years 1 months ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
METMBS
2004
151views Mathematics» more  METMBS 2004»
13 years 9 months ago
Machine Learning Techniques for the Evaluation of External Skeletal Fixation Structures
In this thesis we compare several machine learning techniques for evaluating external skeletal fixation proposals. We experimented in the context of dog bone fractures but the pot...
Ning Suo, Khaled Rasheed, Walter D. Potter, Dennis...
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
ECAI
2004
Springer
14 years 1 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
IJCAI
2007
13 years 9 months ago
Occam's Razor Just Got Sharper
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
Saher Esmeir, Shaul Markovitch