581 search results - page 14 / 117 » An Automata Model for Trees with Ordered Data Values |
82
Voted
KDD
1995
ACM
15 years 1 months ago
1995
ACM
This paper introduces a newalgorithm called SIAO1 for learning first order logic rules withgenetic algorithms. SIAO1uses the covering principle developed in AQwhereseed examplesar...
75
Voted
FMSD
2006
14 years 9 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
ADC
2008
Springer
15 years 3 months ago
2008
Springer
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
BMCBI
2006
14 years 9 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
JMLR
2010
14 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...