Sciweavers

2492 search results - page 129 / 499
» On the General Signature Trees
Sort
View
DAGSTUHL
2006
15 years 7 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
CAI
2007
Springer
16 years 18 days ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 12 months ago
Multi-level genetic algorithm (MLGA) for the construction of clock binary tree
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
Guofang Nan, Minqiang Li, Jisong Kou
AI
2009
Springer
15 years 11 months ago
Enumerating Unlabeled and Root Labeled Trees for Causal Model Acquisition
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs to be assessed for each node. It generally has the comple...
Yang Xiang, Zoe Jingyu Zhu, Yu Li
CG
2006
Springer
15 years 10 months ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom