Sciweavers

42 search results - page 6 / 9
» Expressive Power of Tree and String Based Wrappers
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
13 years 12 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
ALP
1992
Springer
13 years 11 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
KBSE
2005
IEEE
14 years 29 days ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
GECCO
2004
Springer
155views Optimization» more  GECCO 2004»
14 years 23 days ago
Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
Shingo Mabu, Kotaro Hirasawa, Jinglu Hu
BMCBI
2006
122views more  BMCBI 2006»
13 years 7 months ago
A multivariate prediction model for microarray cross-hybridization
Background: Expression microarray analysis is one of the most popular molecular diagnostic techniques in the post-genomic era. However, this technique faces the fundamental proble...
Yian A. Chen, Cheng-Chung Chou, Xinghua Lu, Elizab...